Write a program to load an array, Squares, with 100 numbers. Each element should contain the square of its index value. In other words, Squares[0] = 0, Squares[1] = 1, Squares[2] = 4, Squares[3] = 9, ..... Squares[8] = 64, and so on.
Then prompt the user for a number from 1 through 10,000 and write flowchart code to check if that number is a perfect square (i.e., if the user inputs X, check to see if X is a value in the array).
Use a serial search for this program. Check how many iterations of the search must be made for each number entered by the user.
Provide appropriate output to tell the user whether the number input was a perfect square or not and how many iterations of the search had to be performed to find out.