The function h() takes a pointer to the front of a non-empty singly linked list and a list position pos, 0 pos & front, int pos) \{ node p= front, q; if (pos==0) \{ front = front->next; delete p; \} else \{ for (int i=1;inext q=p>next; p>next=q>next delete q; \} \} Assume the list contains the elements 815->25->33->55->99 front 8>15->25->33->558->15->25->33->998->15->33->55>>998->15->25->55>99 The time required to search an element in a linked list of length n is O(n2) O(n) O(logn) O (1) The seven elements A,B,C,D,E,F and G are pushed onto a stack in reverse order, i.e., starting from G. The stack is popped five times and each element is inserted into a queue.Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is A G B F<>