Given the following binary search tree definitions, where name is the key of the node:

struct recType$\{$

string name;

int age;

recType $*$lChild;

recType $*$rChild;

$\}$;

nodeType $*$root;

Write a recursive function, called listRegister, that displays all names and ages in name order. Each name and age is shown on a separate line. The function has one parameter which is a pointer to the root of the tree.