(Solved): Question 1: Draw a state transition diagram for a simple queue. Assume the queue can hold up to fiv ...

Question 1: Draw a state transition diagram for a simple queue. Assume the queue can hold up to five strings (where a string does not have any whitespace character). The following operations are supported: 1- Enqueue operation. To enqueue a string, the following option must be entered: e followed by the string, e.g., e Ahmed. 2- Dequeue operation. To dequeue a string, the user should enter $d$. The front string is dequeued and displayed to the user. 3- Get Front operation. To get the string at the front, the following options should be entered: $f$. The front string is displayed to the user. 4- To quit, the user should enter ' $q$ '. In this case, the queue content is displayed in the correct order. 5 - If the user enters an invalid option, an error message is displayed asking the user to re-enter a correct option. Based on the state transition diagram you have created, develop a set of black box test cases that cover the key state transitions. For each test case, be sure to describe the exact sequence of inputs, as well as the expected sequence of state changes and actions. You must test the program by executing the test cases. The program is provided as a Java class file (Q1.class on Moodle).