In the array implementation of list, which of the following statements is NOT correct? A. The time complexity ofinsert back member function (add a new element B. The time complexity ofinsert_front member function (add a new C. The time complexity ofremove back member function (remove the D. The time complexity of remove front member function (remove the at the higher index end) isO(). element at the lower index end) is O(n). element from the higher index end) is O(1). element from the lower index end) is O(1)