Given the following queue, which pointer points to the new item when the operation studentsQueue.Queue(new Item) is executed? This queue implementation removes from head when Dequeue is called. studentsQueue head: data: Tom data: Sam data: Tim tail: null next: next: next: using new Item data: Hal null next: The studentsQueue head pointer Node Tom's next pointer The null pointer Node Tim's next pointer

If front=2 and rear=5, how many elements are there in an array-based queue (note: rear is pointing at the next free location) O 3 4 2 5

What values are returned during the following sequence of queue operations, if executed on an initially empty queue? Enqueue(5) 1. 2. Enqueue(3) 3. Enqueue(2) 4. Dequeuel) 5. Enqueue(1) 6. Dequeuel) 7. Dequeuel) 8. Enqueue(4) 9. Dequeuel) 10. Dequeuel)

Algorithms in pseudo code **MUST** be placed in code blocks/fences, and use `cpp` as the syntax highlighter. - Algorithms should follow the pseudo code standard described in *Pseudocode Handout*. - Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. - Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmat h.pdf - Two ways to enter math mode: - Insert a pair of dollar signs: \$your equations go here\$. This is the inline math mode. *Notice that there is no space between the \$ and the letter*. - Insert a pair of double-dollar signs: \$\$ your equations go here \$\$, which produces a standalone equation/formula set. le for sub