(1) (in java)Write in pseudocode an algorithm maxValue(r) that receives as input the root r of a tree (not necessarily binary) in which every node 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 value 9.

For a node v use v.value to denote the value stored in v; v.isLeaf has value true if node v is a leaf and it has value false otherwise. To access the children of a node v use the following pseudocode:in java)

for each child c of v do

(2)Compute the worst case time complexity of your algorithm as a function of the total number n of nodes in the tree. You must

explain how you computed the time complexity

give the order of the time complexity of the algorithm

4 (9 2) (3