How to do these two questions? This is about discrete math.

Programming Questions: the following questions (3 and 4) are programming questions. 3) (20 pts) Solve the recurrence relation for the Tower of Hanoi problem. The problem statement is as follows Given a stack of n disks arranged from largest on the bottom to smallest on top placed on a rod, together with two empty rods (totally 3 rods), the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack from one rod to another, where moves are allowed only if they place smaller disks on top of larger disks. Solve the relation and Plot a graph for the various values of n disks. Give appropriate justifications for your relation 4) (20 pts.) Derive a recurrence relation on Binary Search. Solve the relation and Plot a graph for the various values of n. Give appropriate justifications for your relation. Note: The run time should be calculated for Problems 3 and 4. The graph should be plotted with time on the X axis and value of n on the Y axis