Which is an example of an algorithm for sorting a list of numbers? a. Put the smallest number at the beginning of the list. Put the largest number at the end of the list. Put the remaining numbers in order.
b. Swap the first two numbers in the list. Repeat this process until the last number is reached.
c. Compare the first two numbers in the list. If the second number is larger than the first number, swap the two numbers. Repeat this process.
d. Compare the first two numbers in the list. If the first number is larger than the second number, swap the two numbers. Repeat with the second number and third number, and so on until the last number is reached. Repeat this process starting from the beginning of the list until no more numbers are swapped.

Assume that two parallel arrays have been declared and initialized: healthoption an array of type char that contains letter codes for different healthcare options and annual cost an array of type int. the i-th element of annual cost indicates the annual cost of the i-th element of healthoption. in addition, there is an char variable, best2.write the code necessary to assign to best2 the health option with the lower annual cost, considering only the first two healthcare options. thus, if the values of healthoption are 'b', 'q', 'w', 'z' and the values of annualcost are 8430, 9400, 7050, 6400 your code would assign 'b' to best2 because 8430 is less than 9400 and is associated with 'b' in the parallel array. (we ignore 'w' and 'z' because we are considering only the first two options.)