7. [X points] Below is a pseudocode of a recursive algorithm (node.search) to search a linked list. Incomplete recurrence is given to you. Complete the recurrence equation for the recursive algorithm node.search. list.search(val) if(list.head = null) return false; return list.head.search(val); node.search(val) if(node.val=val) return true; if(node.next=null) return false; return node.next.search(val); n=0,1 T(n)=. _n>1/