Question 2: Draw a state transition diagram for a simple stack machine. Assume the stack can hold up to n data items where n is a small positive number (n>0). It has operations "push" and "pop" that cause the stack pointer to increment or decrement, respectively. The stack can enter states such as full" if it contains n items and, "empty" if it contains no items. Popping an item from the empty stack or pushing an item on the full stack cause a transition to an error state. Based on your state transition diagram, develop a set of black box test cases that cover the key state transitions. Be sure to describe the exact sequence of inputs, as well as the expected sequence of state changes and actions. Assume that the stack is initially empty