Write a C++ program to determine whether 2^p-1, is prime for each of the primes not exceeding 100 also find the running time function of the algorithm you are using to write the corresponding program.

#c++,discrete structures