Find the page in the slides, with the code below and the corresponding memory drawing. How many boxes are drawn and what is the total memory used (the sum of the sizes of those boxes)? struct node * A; // line 1 struct node * B = malloc(sizeof(struct node)); // line 2 A = B; // line 3 B->next = A; // line 4 O 1 box, total memory 12 Bytes O2 boxes, total memory 16 Bytes O2 boxes, total memory 24 Bytes O3 boxes, 24 Bytes O3 boxes, 28 Bytes 3 boxes, 30 Bytes