Given a positive integern, two players play a game. They take turns in choosingdistinct divisors ofnaccording to the following rules:.(i) No divisor ofnthat is a multiple of a previously mentioned number can be chosen.(ii) The player who is forced to choose 1 loses the game. Show that the first player always has a winning strategy. (Hint: Just show its existence usingcontradiction. No constructive proof is known yet !)