The code has to be in C++. Thank you.

Write a program where vou implement Modular Exponentiation (ME) using the square and multiply approach as a function which is called in main. ME calculates a^k mod n. The program should get values for a, k and n from the user. This code requires two steps. First k must be converted to a binary representation K consisting of a list of 0s and 1s. Second, Modular Exponentiation must be performed using a, n and KIl as arguments procedure BinaryK(k) K = empty list //hint: make K a vector tmp k while tmp >0 add y mod 2 to K //hint: use pushback tmp (tmp-K[i])/2 return K procedure ModularExpo(a, K, n) ifn= 1 return 0 return b if K[0]-1 for i = l to length(K)-1 A =A*A mod n ifK[i] = 1 b- A*b mod n return b