Suppose we have problems P1 and P2. Suppose there is a polynomial-time reduction from P1 to P2. a. What can we say about the existence of an efficient algorithm
for deciding P1 if there is an efficient algorithm deciding P2?

b. Can we say the same thing about an efficient algorithm for
deciding P2 if there is an efficient algorithm deciding P1?

(Here an efficient algorithm is one that runs in polynomial-time
in the size of its input).

Create a class named formletterwriter that includes two overloaded methods named the first method takes one string parameter that represents a customer’s last name, and it displays the salutation dear mr. or ms. followed by the last name. the second method accepts two string parameters that represent a first and last name, and it displays the greeting dear followed by the first name, a space, and the last name. after each salutation, display the rest of a short business letter: you for your recent order.