What is the tightest bound big-Oh () time complexity for the following code in terms of input size ? Show all necessary steps:

Algorithm MyAlgorithm (A,B)
Input: Arrays A and each storing ≥1 integers.
Output: What is the output? (Refer to part b below)
Start:
count =0
for =1 to *** do {
sum =0
for =1 to do {
sum = sum +[0]
for =1 to do
if (≤-1)
sum = sum +[]
}
if [-1]≤(
[-1]≤ sum then count = count +1
}
return count