a.[CO7]Calculate the time complexity of the following function Finding_Worst_Case(n): b. [CO7] Calculate the time complexity of the following recurrence relation. [Any method is acceptable as long as steps are shown] T ( n ) = T ( n /2 ) + T ( n /4 ) + n.