[2%, 2%, 2%] A job priority queue is implemented using a Min-Heap in which a lower key value represents a higher priority. The jobs are entered and stored in the Min-Heap as shown in the following array .
| index | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| key value | -- | 6 | 8 | 10 | 12 | 24 | 15 | 13 | 20 | 18 | 26 |
(i) [Step 1] Next job is extracted from the job queue for execution. What is the value of in the remaining job queue? (A) 15 (B) 18 (C) 20 (D) 26 (E) None of the above
(ii) [Step 2] After Step (1) is executed, next job is extracted from the job queue for execution. What is the value of in the remaining job queue? (A) 13 (B) 15 (C) 18 (D) 24 (E) None of the above
(iii) [Step 3] After step (2) is executed, a new job with priority 11 is inserted into the job queue. What is the value of in the remaining job queue? (A) 18 (B) 20 (C) 24 (D) 26 (E) None of the above