1. Are the following topics covered in the portion of the chapter that you were supposed to read for today's class? mark Y (yes) or N (no) for each topic:
2. Let us assume that a queue of instructors is implemented as an array of size 3. Show, step-by-step, what will happen if first Kr (Kreinovich) arrives at the queue, then Ki (Kiekintveld) follows, then Kr is served, then G (Gallegos) and R (Roy) join the queue.
3. For extra credit: write codes for dequeue when the queue is implemented as an array and as a linked list.