Data Structures (Java) Please solve it on a sheet of paper

1. Given the following queue q, show the contents of the queue q after each operation of the following code segment, given that queue data is of the type char. front 'F' 'T' 'N' 'W' W Ere rear char item = q. deque (); g.enque ('B'); q.enque ('D'); item = q. de que(); g.enque ('W'); q.enque (item); 2. Show the output of the following code segment, given that queue data is of the type char. Queue q2 new Queue (); char item1 = 'D' ; char item3 = 'N'; char item2 = 'F'; char item4; q2.enque (item3); q2.enque (iteml); q2.enque (item2); item2 = 22. deque(); 92.enque (iteml); q2.enque (item2); while (!q2.isEmpty()) { item4 = 22.deque (); System.out.println(item 4); } System.out.println(item1+" "+item2+" "+item3+" "+item4); 3. Show the steps of applying Radix Sort to the array: 59, 62, 390, 381, 54, 237, 755, 162, 312, 22