provide a handwritten proof for each question

Q1: (3 marks) Read definition of divisibility, definition 1.1.1, and prove that for natural numbers & and n, if k does not divide n, then k cannot divide n either. (The intuitive answer is very trivial, but we want a concise, formal answer.) Q2: (3 marks) Given a natural number k, assume there are exactly k many natural numbers r, such that 1