answer these questions based on design and algorithm course. PLease answer themc orrectly and completely showing correct formulas

$1.17.$ Given a heap with n nodes, if we know that there are $74$ leaves in this heap, what are the possible values you can take for n$?$

Ans:

$2.$ Given a heap with n nodes, if we know that there are $237$ longest paths from the

root, what is the smallest number for n$?$

Ans:

$3.$ Solve the first order linear recurrence relation: Fn $=5$Fn$1+4$ with the initial value F$0=0.$

Solution