Assignment
1. Implement Selection-Sort scheme with the given java codes. This scheme is basically two phases:
a. Phase 1: Insert all elements of a sequence S into a priority queue P.
b. Phase 2: Repeatedly remove the minimal element from P using a relevant method from your given classes.
Show your test program that emulates the figure shown below.
2. In an empty Red-Black Tree (RBT), say, you insert entries with keys, 30, 40, 24, 58, 48, 26, 11 and 13 (in this order). How will your RBT look like after all insertions?
3. Would a Heap implementation with the same insertions as Q2 look like the answer to Q2?