THIS IS C LANGUAGE where children is an array of pointers to subtrees and num$\_$children is the length of

the array.

$($a$)(2$ points$)$ Briefly describe how a prefix$-$trie can be used to efficiently store a set of

strings. For example, the example trie above stores the set $"$AB$","$AC$"$

A prefix$-$trie is a tree that satisfies the following constraints:

A node can have arbitrarily many children

All the children of a given node must contain distinct values

All leaf nodes must contain the same value

For example, consider the following three trees:

The first one is a valid prefix$-$trie, but the second one violates rule $(2)$ and the third one

violates rule $(3).$

Use the following implementation of a prefix$-$trie to answer the questions below:char value;struct prefix$\_$trie $**$children;

$\}$;