Given a $(2,4)$ Tree. Write a pseudocode for the function inOrder$($Node $*$p$)\{..\}$ to list all its keys. A node structure consists of

Node $\{$

Node child$[4]$;

int key$[3]$; int k;

$\}$

where an integer k keeps track of number of children currently present.