When using the linked structure (shown in the following figure) to implement queue ADT, which of the following statements is NOT correct? 5. 20 | 30 50 head A. The insertion should be performed from the head and the deletion should be performed at the tail in order to have O(1) for both operations; B. The insertion should be performed from the tail and the deletion should be performed at the head in order to have 0 (1) for both operations; C. The time complexity of deletion performed at the tail is 0(N); D. The time complexity of insertion performed at the tail is 0(1)