i. Find O(n) for the function f(n)=12n2logn11+n25log(15n4) (s marks) ii. Compute the efficiency class of the following algorithm: (5 marks) AIGORITHM AIg (A (0n1]) I Input: A matrix A A(0n1,0n1) of real numbers Fox i0 to n2 do fox j=1+1 to n1 do if A[i,j]=A[j,i] return true return false iii. Consider the following algorithm: ATGORTTHM A(n) //Input: A positive integer n if n=1 return 1 Find the recurrence relation for the number of basic operations for this algor then solve it using backward substitution