3. Assume that a queue of students waiting to be advised is implemented as an array of size 3. Show, step-by-step, what will happen if these events occur in this order: student A joins the queue, B joins the queue, A is served, and C and D and R join the queue.
8. Write a recursive algorithm for searching for a given element in a binary search tree. Then implement the algorithm in Java.