Problem 21 For each of the following algorithms, which each receive an integer as input, determine what they do, establish the corresponding recurrence, and solve it to find the computational complexity. ALGORITHM Tin Il Input a positive integer n if n = return 1 else return T(n-1) + h*nt n ALGO RITHM UVCn 1/ Input a positive integern if n=1 return 1 else return UV (floor (1/2)) + 1