$(20$ points$)$ According to the textbook, a dynamic data structure is a structure that can expand and contract as a program executes. C$\text{'}$s facilities for creating these structures allow a program to defer until a later time its decision regarding how much space to use in processing a data set. For example, each node in data structure maystore an element$\_$t $($e$.$g$.$ int, char, struct$)$ with one or more pointers.