【第3-4题】设有一个不带表头结点的单链表，下面递归算法的功能是：(1) 删除以head为头指针的单链表中值为x的所有结点。(2) 输出以head为头指针的单链表中最大结点值。(3) 删除并释放以head为头指针的单链表中所有结点。请在空白处填入正确的语句。(1)voiddelall(LinkList&head,ElemTypex){LinkListp;if(head!=NULL){if(________①_________){p=head;________②________;free(p);_________③______________;}elsedelall(head->next,x);}}(2)ElemTypeMaxValue(LinkListhead){ElemTypem;if(__________④___________)return(head->data);m=_______⑤_________;if(_______⑥_________)returnm;elsereturnhead->data;}(3)voidrelease(LinkListhead){if(_______⑦________){release(head->next);_______⑧________;}}