The answer is E I was wondering if you can explain it to me in a simple and concise manner.

4. Assume that the following types have been given: class NodeType public int value: public NodeType next: Suppose that a Queue of nodes of type NodeType has been im Queue operations add (enqueue) and remove (dequeue) Co plement the porting the usual wing pseudocode: do time 0 dequeue an element, call it node do node.value-node.value1 time = time + 1 while (node.value !-) && (time !-Linit) if node.value0 enqueue Node while there are nodes left in the queue Suppose that initially the values of the nodes in the queue are: 1, 10, 8, 5, 12 (The value of the node at the front of the queue is 1 and the value of the node at the end of the queue is 12.) Which of the following is the least value of Limit that would ensure that the total number of dequeue operations is 6 or less? (A) 3 (B) 5 (C) 6 (D) 7 (E) 10 7:17 PM O Type here to search ; 1/24/2019 ^ SAMS