Analyze the running time of the following algorithm FOO.

FOO(A, B, n)

1 // Input: Two size-n arrays A[1..n] and B[1..n]

2 for i = 1 to n

3 if A[i] B[i]

4 return false

5 return true

(1) What is algorithm FOO doing? That is, given a valid input, when does FOOreturn false and when does FOO return true?