Please answer part C and part D. Please do not copy and paste a previously answered chegg study question?

The set D is the set of all natural numbers greater than or equal to 12, i.e. D = {n N | n 12}.

The predicate function P(n) is "a class with n students can be divided into groups of 4 or 5". So the theorem can be written in symbolic form as: nD, P(n): "For any natural number n greater than or equal to 12, a class with n students can be divided into groups of 4 or 5."

4. In this question you will prove by strong induction the following: For any natural number n prove that a class with n12 students can be divided into groups of 4 or 5. Before you start, you will need to translate this theorem in symbolic form, in the form of nD,P(n) A. Set D What is the set D in the symbolic form nD,P(n) of the theorem you will prove? B. P(n) What is the predicate function P(n) in the symbolic form nD,P(n) of the theorem you will prove? You will now prove the theorem by strong induction. No other method is acceptable. Be sure to lay out your proof clearly and correctly and to justify every step. C. Basic Step of the Proof Write the basic step of your proof here. Inductive Step of the Proof Write the inductive step of your proof here