Please help, if you can explain in detail for #6 I will be very grateful..I will rate

Q6: What is wrong with the following proof"? (3pt) Show that "all horses are the same color". Let P(n) = a set of n horses being the same color Basis step: P(1) is true because one horse is the same color Assume P(k) is true, i.e., all the horses in any set of k horses are the same color Show that P(k + 1) is true: Let hi, h2, ..., hk, hk+1 be k + 1 horses in a set By inductive hypothesis {h1, h2, ..., hk} has the same color and {h2, h3, ..., hk+1} have the same color. Therefore {h1, h2, h3, ..., hk+1} has the same color. Q7: Prove that if x and y are real number, then max(x, y) + min(x, y) = x + y. Use a proof by all cases, i.e., x y Q8: Prove that 2 divides na + n for all positive integer n