Analyze the running time of the following algorithm F00. F00(A,B,n) 1 // Input: Two size-n arrays A[1n ] and B[1n] 2 for i=1 to n 3 if A[i]=B[i] 4 return false 5 return true (1) (2pts) What is algorithm F00 doing? That is, given a valid input, when does F00 return false and when does F00 return true? (2) (3pts) Analyze the best-case running time of algorithm F00 in terms of n and give a tight bound (using notation) on it. (3) (3pts) Analyze the worst-case running time of algorithm F00 in terms of n and give a tight bound (using notation) on it