Please show work. No credit for an answer obtained by running a program. Write parts of a program only where requested. Show how you got each answer. Do the work by hand. Please clearly number each problem answer and work. 5) UP RIGHT LEFT UP B Each node has pointers LEFT , RIGHT, UP, and an integer data struct Node { Node *UP; Node *LEFT; Node *RIGHT Int data; } Write a c++function named OUT that visits each node once and cout its data. You can do this in any order, but you must use the pointers. You can start with any node, but can only directly address the node you start with. The other 2 nodes must be be visited using pointers