4 120 points Consider the following algorithm for doing a postorder traversal of a binary tree with root vertex root. Algorithm 1 Postorder Traversal POSTORDER (root) if root* null then POSTORDER (rootleft) POSTORDER (root.right); visit root; end if; Prove that this algorithm runs in time (n) when the input is an n-vertex binary tree