by induction proof. Can someone help me with this please.

4. For proof that Kn has n(n- 1)/2 edges. Note that n represents the number of vertices, which is what you will be doing the induction on. Recall for an inductive n 21, give an induction proof you must: a. b. c. d. State the theorem you will be proving State what you are doing the induction on Label, state, and prove the base case Label and state the inductive hypothesis which should begin Assume for some arbitrary k2 1.. Label, state, and prove the inductive step and give reasons for each line in the proof. This should begin: Show for k+1 e