question number 4 and 5 (both parts) please. for question 5 try to follow the convention provided in the back. thanks.

3.5 marks) Consider the following algprithm Algorithm foon) rr+foo(n -I) The time complexity of this algorithm is given by the following recurrence equation 1(0) order using big-Oh notation. You must explain bow you solved the recurrence equation (not necessarily binary) in which every node where o. cy, and cs are constants. Solve the recurrence equation and give the value of f(n) and its 5.(6) (7 marks) Write in pseudocode an algorithm naxValue (r) that receives as input the root r of a tree stores an integer value and it outputs the largest value stored in the nodes of the tree. For example, for the following tree the algorithm must output the val lue