3. Consider the following algorithm fun (A[1, ..., 4n]): if A.length == 0: return 0 return 1 + fun (A[3, ..., 4n-2]) Find a recurrence for the worst-case runtime complexity of this algorithm. Then solve your recurrence and get a tight bound on the worst-case runtime complexity