The algorithm for computing the Egyptian fraction for a rational number x/y is shown below. Which of the following statements is the best in explaining on how this algorithm is designed from general problem-solving strategy? find(f) { if f = 0 stop else { part = 1/(ceiling of f) write down part find(f - part) } } Select one: O a. The algorithm is designed from the use of reduce-and-conquer problem solving strategy for finding the Egyptian fraction of a rational number through finding the Egyptian fraction of a smaller number and use it to generate the Egyptian fraction of the original number. O b. The algorithm finds the Egyptian fraction of a rational number through using recursive call and if statement. O c. The algorithn designed from the use of divide-and-conquer by the Egyptian fraction of a rational number throu finding the Egyptian fractions of a smaller number and 0, and combine them together to form the Egyptian fraction of the original number. O d. The algorithm is both correct and efficient