a linked list node is declared as shown below. the function func$0$ has two arguments which are pointers to two separate linked nodes and is compiled into MIPS as shown on the right. struct node $\{$ int C; struct node $*$next;$\}$ #$a$0$ has ptrA; $a$1$ has ptrB func$0$: lw $t$0,($$a$0)$ #$t$0$ has a local variable p lw $t$1,($$a$1)$ #$t$1$ has a local variable q bgt $t$0,$ $t$1,$ L$1$ sw $a$1,4($$a$0)$ or $a$1,$ $a$0,$ $$0$ L$1$: jr $ra a$.$ translate the MIPS code one instruction at a time to pseudo$-$C code with $($conditional or unconditional$)$ goto statements and using local integer variables p and q for registers $t$0$ and $t$1$ respectively. void func$0($struct node $*$ptrA$,$ struct node $*$ptrB$)\{$ int p $=$ int q $=$ b$.$ Translate the pseudo$-$C code to high$-$level C code without using local variables, gotos, or bitwise boolean operators. void func$0($struct node $*$ptrA$,$ struct node $*$ptrB$)\{$