Frying hamburgers There are n hamburgers to be fried on a small grill thatcan hold only two hamburgers at a time. Each hamburger has to be friedon both sides; frying one side of a hamburger takes $1$ minute, regardless ofwhether one or two hamburgers are fried at the same time. Consider thefollowing recursive algorithm for executing this task in the minimum amountof time. If n $<=2,$ fry the hamburger or the two hamburgers together on eachside. If n $>2,$ fry any two hamburgers together on each side and then applythe same procedure recursively to the remaining n $2$ hamburgers.

A$.$ Set up and solve the recurrence for the amount of time this algorithm needsto fry n hamburgers.

B$.$ Explain why this algorithm does not fry the hamburgers in the minimumamount of time for all n $>0.$

C$.$ Give a correct recursive algorithm that executes the task in the minimum amount of time. Please show all steps.