Unless otherwise instructed write a recurrence relation describing the worst case running time of the following algorithm and determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution using the substitution method. Ali9] represents an array of n-j-1 + 1 integers starting at index i and ending at index j and A[k] represents the value at index k (15 points each 10 free points.) e) FUNCTION F (A1..n) f) For this one, you only have to find the IF n 20 THEN RETURN(A[n) recurrence relation(s) FUNCTION F(A1,n) FOR i1 TO 4 DO IF n 20 THEN RETURN (A[n) FOR j1 TO In/2] DO if-n- 5 WHILE i 2 10 DC RETURN() RETURN(x) Unless otherwise instructed write a recurrence relation describing the worst case running time of the following algorithm and determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution using the substitution method. Ali9] represents an array of n-j-1 + 1 integers starting at index i and ending at index j and A[k] represents the value at index k (15 points each 10 free points.) e) FUNCTION F (A1..n) f) For this one, you only have to find the IF n 20 THEN RETURN(A[n) recurrence relation(s) FUNCTION F(A1,n) FOR i1 TO 4 DO IF n 20 THEN RETURN (A[n) FOR j1 TO In/2] DO if-n- 5 WHILE i 2 10 DC RETURN() RETURN(x)