Question

Can you plzz do part D .

Transform and Conquer Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class.
a. You are given n telephone bills and m checks sent to pay the bills (n ≥ m). Assuming that telephone numbers are written on the checks, find out who failed to pay. (For simplicity, you may also assume that only one check is written for a particular bill and that it covers the bill in full.)
b. You have a file of n student records indicating each student’s number, name, home address, and date of birth. Find out the number of students from each of the 50 U.S. states.
c. For a given positive integer n, find the pair of integers whose sum is n and whose product is as large as possible.
d. How many one-digit additions are made by the pen-and-pencil algorithm in multiplying two n-digit integers? (You may disregard potential carries.)

Answer 1

Answer: