Consider the following structure of node and linked list struct Node t int key; Node *next; 10-> 20-> 30-> 10-10-> 50->10 >NULL What will be the output of following pseudo-code? Consider head is the pointer to the first node of above linked list. Node *walker = head; int count 0; while(walker!- NULL &&count 3) f if(walker->key 10) { count count 1; walker-walker->next; Node *walker = head; int count = 0; while (walker!= NULL && count key= 10) { count = count + 1; walker walker->next; = cout key