Please answer A, B, C, and D.

This question asks you to merge two sorted linked lists into a single sorted linked list Merging the two sorted list changes some links. Figure (a) shows an example of two sorted linked lists. The modified links, as shown in Figure (b), are marked by thicker arrows. In this example, two links are changed. 62NULL A 18 21 6NULL 21 B 35 47 This is another example of merging two sorted linked lists. A 18 31 A 18 31 42 B 25 37 B 25 Consider two sorted linked lists storing distinct values (i.e., every value is unique. A: If each list has 10 nodes (totally 20 nodes), what is the minumum nmber of changed links? B: If each list has 10 nodes (totally 20 nodes), what is the maximum number of changed links? C: please fill the code. 1 / take two sorted linked list 2 // return the merged sorted linked list 3 #include "list.h" 4 Node List Merge (Nodelist1, Nodeliat2) 6 if (list!= NULL) return list2; 10 if (list2NULL) 12 return list1 This question asks you to merge two sorted linked lists into a single sorted linked list Merging the two sorted list changes some links. Figure (a) shows an example of two sorted linked lists. The modified links, as shown in Figure (b), are marked by thicker arrows. In this example, two links are changed. 62NULL A 18 21 6NULL 21 B 35 47 This is another example of merging two sorted linked lists. A 18 31 A 18 31 42 B 25 37 B 25 Consider two sorted linked lists storing distinct values (i.e., every value is unique. A: If each list has 10 nodes (totally 20 nodes), what is the minumum nmber of changed links? B: If each list has 10 nodes (totally 20 nodes), what is the maximum number of changed links? C: please fill the code. 1 / take two sorted linked list 2 // return the merged sorted linked list 3 #include "list.h" 4 Node List Merge (Nodelist1, Nodeliat2) 6 if (list!= NULL) return list2; 10 if (list2NULL) 12 return list1