Complete the function "recursivePower" using a recursive method such that it does the same things "iterativePower".function ¢ = iterativePower(a,b)% Implementation of ab without using the operator...

be hurry plz! its due at 20:30 today!!! thx


Complete the function "recursivePower" using a recursive method such that it does the same thing s "iterativePower". function ¢ = iterativePower(a,b) % Implementation of ab without using the operator ~ % Limited to b greater than or equal to zero c=1; for i = 1:b c=c* aj; end end Complete the body of the below function... function ¢ = recursivePower(a,b) % Recursively implement the code to function the same as the function iterativePower end You will only get credit if "recursivePower" is implemented recursively. You find that an algorithm may take the following maximum number of operations for an input data of size "n 87*n"2 + 3*n*log(n) + 101 What is the worse case Big O notation for this algorithm? You want to solve the function "x2 = 5" for x. You decide to use the bracketing bisection method with initial guesses of Xminus = 1 and Xpjus = 5. Complete the following chart which contains the the values for Xminus, Xplus and Xmiq after every iteration of this method. Xminus Xplus Xmid 1 5 After 1st iteration After 2nd iteration After 3rd iteration Using... >> x =0:1:10 >> On =x; >>0n2 =x."2; Provide the code to create the following plot. Big O Classes 100 a) oom?) 90 80 70 60 50 fn) 40 30 20 Complete the code below which will write the following output to the file "avgExams.txt": John 85 Ann 90 Robert 70 (NOTE: This file has an "extra" blank line at the end.) exams = { 'John', 85; 'Ann', 90; . 'Robert', 70 }; fid = fopen( , ) i for fprintf ( , ’ ’ end (fid) ;