If we tаke the lineаr cоngruentiаl algоrithm with an additive cоmponent of 0, Xn+1 = (aXn) mod mThen it can be shown that if m is prime and if a given value of a produces the maximum period of m – 1, then ak will also produce the maximum period, provided that k is less than m and that k and m – 1 are relatively prime. Demonstrate this by using X0 = 1 and m = 31 and producing the sequences for ak = 3, 32 and 34.What is the smallest number k such that ak will produce the maximum period of m - 1