1) write any C++ or java programming for each one of these as follows:

a) Is 7 a primitive root modulo 65537? How many calculations" multiplications" are needed?

b) solve 7^x 2 (mod 65537)

c) A first non- trivial approach to solving discrete logarithms is the baby step giant algorithm of shanks. first learn it and use it to solve

2^x 18465502604450 (mod 247457076132467) but before using this method, try to solve this DLP by brute force. how did it go? Calculate how much storage space you need to implement the Shanks algorithm for this problem.