Consider list A=(w, 1, y, z), deployed to implement a Queue Abstract Data Type. 1. Let the head of A correspond to the front position of the Queue. Implement operations enqueue (el, A) and dequeue (A) using list construction operations. In both cases we can refer to N as the state of the list upon successful termination of one of its operations. Consider list A=(w, 1, y, z), deployed to implement a Queue Abstract Data Type. 1. Let the head of A correspond to the front position of the Queue. Implement operations enqueue (el, A) and dequeue (A) using list construction operations. In both cases we can refer to N as the state of the list upon successful termination of one of its operations