Consider the following statement. For every integer m, 7m + 4 is not divisible by 7. Construct a proof for the statement by selecting sentences from the following scrambled list and putting them in the correct order. Suppose that there is an integer m such that 7m + 4 is not divisible by 7.But k m is an integer and 7 4 is not an integer.Subtracting 4m from both sides of the equation gives 7 = 4k 4m = 4(k m).Suppose that there is an integer m such that 7m + 4 is divisible by 7.By definition of divisibility 7m + 4 = 7k for some integer k.Subtracting 7m from both sides of the equation gives 4 = 7k 7m = 7(k m).By definition of divisibility 4m + 7 = 4k, for some integer k.Dividing both sides of the equation by 7 results in 4 7 = k m.Dividing both sides of the equation by 4 results in 7 4 = k m.But k m is an integer and 4 7 is not an integer. Proof by contradiction: ---Select--- ---Select--- ---Select--- ---Select--- ---Select--- This result is a contradiction. Hence we can conclude that the supposition is false and the given statement is true