Problem 3 You are given a tree represented by the following data structure. Nodes have three fields: element, left-child, and right-child. The element is a integer. Write a procedure (pseudocode) with input parameter the location of the root node (or pointer to the root node), and that computes the average value of the elements in the tree. However, do not use recursion. Use a stack instead. Analyze the running time of your algorithm, as a function of the number of nodes in the tree. As proven in CS 331, stack operations are 0(1)