assume the following struct: struct node { int data; node *next; }; the head pointer: node *head; and the following contents in memory: address data next 101 7 103 102 9 105 103 4 102 104 6 105 105 3 NULL if head points to address 101, would that be a valid list? 1) YES or NO Answer: Yes: 7 (101) - 4 (103) - 9 (102) - 3 (105) - NULL if head points to address 102, would that be a valid list? 2) YES or NO Anser: Yes: 9 (102) - 3 (105) - NULL if head points to address 104, would that be a valid list? 3) YES or NO Answer: Yes: 6 (104) - 3 (105) - NULL if head points to address 103, how many elements would the list have 4) INVALID, 0, 1, 2, 3, 4, 5 Answer: 3: 4 (103) - 9 (102) - 3 (105) - NULL Note: Some people counted NULL as element. This was unclear, so 4 is also counted as correct assume the following int-array: int a[10] = {7,3,2,4,6,9,12,1,1,3}; After processing it with selection sort for increasing order with <, what would be the contents of a? 5) 0|1|2|3|4|5|6|7|8|9 -+-+-+-+-+-+-+-+-+- | | | | | | | | | Answer: 0|1|2|3|4|5|6|7|8|9 -+-+-+-+-+-+-+-+-+- 1|1|2|3|3|4|6|7|9|12 What is the INDEX of the first element that gets selected? 6) numeric answer Answer: 7 (the first one is the smallest) Note: Again, this was unclear, so 0 will also count as correct What is the VALUE of the first element that gets selected? 7) numeric answer Answer: 1 When selecting the first element, how many comparisons are needed? 8) numeric answer Answer: 9. (The first element has to be compared to every other element)