Complete the following function so that it deletes the middle Node from a doubly linked list. You may assume that the list passed to this function will have at least 3 Nodes and will have an odd number of Nodes. void deleteMiddle (Node* head, Node* tail) { Node* h head; Node* t = tail; while (h->next = t->prev) { } } h = t = Node* temp = d. delete f. = h. a. b. C. e. g. ; ; a: b: C: d: e: f: g: h: