Question 1 (1 point) Consider the following wait-free single-enqueuer/single-dequeuer FIFO queue. After which line does a successful enqueue become apparent to the dequeuer? Enter a numeric line number. 1 2 3 4 5 6 7 8 9 10 class WaitFreeQueue { int head = 0, tail = 0; T[] items; public WaitFreeQueue (int capacity) { items = (T[]) new Object[capacity]; } public void eng(1 x) throws FullException { if (tail - head == items.length) throw new FullException(); items [tail % items.length] - X; tail++; } public T deg() throws EmptyException { if (tail - head == 0) throw new EmptyException(); T X = items [head % items.length]; head++; return x; } } 11 12 13 14 15 16 17 18 19 20 Question 2 (1 point) Consider the following wait-free single-enqueuer/single-dequeuer FIFO queue. After which line does a successful dequeue become apparent to the enqueuer? Enter a numeric line number. 1 2 3 4 5 6 7 8 9 10 class WaitFreeQueue { int head = 0, tail = 0; T[] items; public WaitFreeQueue(int capacity) { items = (T[]) new Object[capacity]; } public void eng(T x) throws FullException { if (tail - head == items.length) throw new FullException(); items [tail % items.length] = x; tail++; } public T deg() throws EmptyException { if (tail - head == 0) throw new EmptyException(); T x = items [head % items.length]; head++; return x; } } 11 12 13 14 15 16 17 18 19 20 Question 1 (1 point) Consider the following wait-free single-enqueuer/single-dequeuer FIFO queue. After which line does a successful enqueue become apparent to the dequeuer? Enter a numeric line number. 1 2 3 4 5 6 7 8 9 10 class WaitFreeQueue { int head = 0, tail = 0; T[] items; public WaitFreeQueue (int capacity) { items = (T[]) new Object[capacity]; } public void eng(1 x) throws FullException { if (tail - head == items.length) throw new FullException(); items [tail % items.length] - X; tail++; } public T deg() throws EmptyException { if (tail - head == 0) throw new EmptyException(); T X = items [head % items.length]; head++; return x; } } 11 12 13 14 15 16 17 18 19 20 Question 2 (1 point) Consider the following wait-free single-enqueuer/single-dequeuer FIFO queue. After which line does a successful dequeue become apparent to the enqueuer? Enter a numeric line number. 1 2 3 4 5 6 7 8 9 10 class WaitFreeQueue { int head = 0, tail = 0; T[] items; public WaitFreeQueue(int capacity) { items = (T[]) new Object[capacity]; } public void eng(T x) throws FullException { if (tail - head == items.length) throw new FullException(); items [tail % items.length] = x; tail++; } public T deg() throws EmptyException { if (tail - head == 0) throw new EmptyException(); T x = items [head % items.length]; head++; return x; } } 11 12 13 14 15 16 17 18 19 20