Must be in pseudo-code with comments. ( no c++ or java etc code please)

1. Write an efficient algorithm FindMaxProduct(T) in pseudocode that returns the maximum product of the key values on all possible paths in the tree T, which is passed as the input to the function. For the tree below, your algorithm should return a value of 240 (from the path with key values 5 ?2 3 4 ?2 ).

Suppose T is a binary tree that stores an integer key value in each node.

Assume the following notation/operations on a binary tree.

the key T.key is the root nodes integer key value

the left child T.lef t is Ts left subtree, which is possibly an empty tree (or null)

the right child T.right is Ts right subtree, which is possibly an empty tree (or null)

3 -2 0 -2 You must include appropriate comments in your pseudocode