Please show me how this exactly works.(Detail)!

3.7 As part of the development team at Mumble Tech.com, Janet has written a list manipulation library for C that contains, among other things, the code in Figure 3.16 (a) Accustomed to Java, new team member Brad includes the following code in the main loop of his program list-node* L = 0; while (more_widgets)) L -insert (next widget), L); L - reverse (L); r 3 Names, Scopes, and Binding:s Sadly, after running for a while, Brad's program always runs out of memory and crashes. Explain what's going wrong After Janet patiently explains the problem to him, Brad gives it another try: (b) list-node* L = 0; while (more_widgetsO) L insert (next-widget (), L); list node* T- reverse (L); delete_list (L) This seems to solve the insufficient memory problem, but where the program used to produce correct results (before running out of mem ory), now its output is strangely corrupted, and Brad goes back to Janet for advice. What will she tell him this time