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

The set D in the symbolic form Vn ED, P(n) of the theorem is:

D = {n Z | n 1}

The predicate function P(n) in the symbolic form VnE D, P(n) of the theorem is:

P(n): (ab) | (a"-b") for all a, b Z such that 1 b

3. In this question you will prove by mathematical induction the following: Prove that (ab)(anbn) i.e. (ab) divides (anbn)a,b,nZ such that n1 A. Set D What is the set D in the symbolic form nD,P(n) of the theorem you will prove? 3. 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 mathematical 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