Unless otherwise instructed write a recurrence relation describing the worst case running time of each the following algorithms and determine the asymptotic complexity of the func- tions defined by the recurrence relation using either expanding into a series or a recursion tree. Justify your solutions using the substitution method. A[i ... j] represents an array of n = j-i+1 numbers starting at index i and ending at index j and A[k] represents the value at index k. (25 points each) 1.) FUNCTION F1 (A[1...n]) IF n summation. 3.) FUNCTION F3(A[1...n]) IF n 10 DO A[i] + A[i] + A[i+ 3] I + x + F1(A[1...i]) iti - 2 RETURN(X) 1 Unless otherwise instructed write a recurrence relation describing the worst case running time of each the following algorithms and determine the asymptotic complexity of the func- tions defined by the recurrence relation using either expanding into a series or a recursion tree. Justify your solutions using the substitution method. A[i ... j] represents an array of n = j-i+1 numbers starting at index i and ending at index j and A[k] represents the value at index k. (25 points each) 1.) FUNCTION F1 (A[1...n]) IF n summation. 3.) FUNCTION F3(A[1...n]) IF n 10 DO A[i] + A[i] + A[i+ 3] I + x + F1(A[1...i]) iti - 2 RETURN(X) 1