4] (15 pts.) This is the pseudocode of a non-recursive algorithm: ALGORITHM fun (A[0n1][0n1] ) //Input: A two-dimensional array (matrix) of integers //Output: A Boolean value (true/false or 1/0 ) for i0 to n3 for ji+2 to n1 if A[i][j]=0 return false return true (a) ( 1 pt.) What is the fundamental operation that describes its efficiency? Answer: (b) (3 pts.) What is the best case for the algorithm efficiency? Answer for the best case: Cbest(n)= Explain when it happens: (c) (3 pts.) What is the worst case? Explain in your own words when it happens: (d) (4 pts.) Set up a summation for the worst case, using the summation symbols: cworst(n)= (e) (4 pts.) Solve the summation to find an exact expression (no approximations!) for Cworst(n) : (f) Find the efficiency class for Cworst(n)