Finding the element in an vector data structure with a given value requires a worst case time: O 0(1) O O(log n) O(n) O 0in2) Question 11 In the linked-list implementation presented in the book, a header and tail node is used: To simplify the implementation of find operation. Because there would be no other way to make the current pointer indicate the next element on the lis To simplify the implementation of remove and insert operations