Problem 1. Write a C++ program to find and print the first perfect square (i*i) whose last two digits are both odd. please try to explain every step by writing comments.

Problem 2.Write a function

bool equivalent(int a[ ], int b[ ], int n)

which takes two arrays a and b of length n and returns true is they are shift equivalent and false otherwise. please try to explain every step by writing comments.