Question 3 1 pts The function h() takes a pointer to the front of a non-empty singly linked list and a list position pos, 0 pos void h(node* & front, int pos) { nodep = front, *q; if (pos == 0) { front = front->next; delete p; } else { for (int i = 1; i next; q- p->next; p->next = q->next; delete q; } } Assume the list contains the elements 8 -> 15 -> 25 -> 33 -> 55 -> 99 front O 8 -> 15 -> 25 -> 33 -> 99 8 -> 15 -> 33 -> 55 -> 99 O 8 -> 15 -> 25 -> 55 -> 99 O 8 -> 15 -> 25 -> 33 -> 55