#####ANSWER IS GIVEN AS A.)

I need to understand why this works but the others do not. Thank you

.

.

.

.

.

.

10. Which of the following loops will correctly delete all nodes from a linked list named list and release the memory that they occupy? a) struct node "p; while (list != NULL) 13t list->next ; = Eree (p) b) struct node *pi fortp = list; p != NULL ; p = p->next ) free (p) c) struct node pre *cur; for (prev= NULL, cur= list; cur !-NULL ; cur=cur->next){ prev = cur free (pxex)i d) A or C e) None of the above