- #1

Tvtakaveli

- 5

- 0

(a) A sorting algorithm takes one operation to sort an array with one item in it.

Increasing the number of items in the array from n to n + 1 requires at most an

additional 2n + 1 operations. Prove by induction that the number of operations

required to sort an array with n > 0 items requires at most n^2 operations.

(b) Show by induction that if n ≥ 1, then 7n − 1 is a multiple of 6.

So I'm confused to what the question even is and how to put it into a statement. Thank you.