Write in pseudocode(in Java) 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 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:

"for each child c of v do"