Write an algorithm that returns the index of the last occurrence of the key value in the sequence s1,..., sn. If the key is not in the sequence, the algorithm returns the value 0. Example: If the sequence is: 12, 11, 12, 23 and the key is 12, the algorithm returns the value 3

Can you please also explain what are the differences between the two algorithms?

Divide and Conquer is one of the important design method for Algorithm. What is the major feature to design an algorithm applying the Divide and Conquer idea ? 單選: a. Recursive in Assign, Calculate, Output. O b. Recursive in Assign, Divide, Conquer. O c. Recursive in Divide, Calculate, Combine. d. Recursive in Divide, Conquer, Combine. e. Recursive in Calculate, Conquer, Combine. We call it as 3C.