Please describe step by step in detail. Thank you :)

5. (10 points) Frying hamburgers: There are n hamburgers to be fried on a small on both sides; frying one side of a hamburger takes one minute, regardless of whether one or two hamburgers are fried at the same time. Consider the following recursive algorithm for executing this task. If nS 2, fry the hamburger (or the two hamburgers together if n 2) on each side. If n> 2, fry two hamburgers together on each side and then fry the remaining n- 2 hamburgers by the same algorithm. a. Set up and solve the recurrence for the amount of time this algorithm needs to fry n hamburgers. bu t o gorithm dos not ry the hamburgers in the minimum amount of time for all n >0 c. Give a correct recursive algorithm that executes the task in the minimum amount of time for all n > 0 and find a closed-form formula for the minimum amount of time