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[3] = 9, Squares[8] = 64, and so on. Then prompt the user for a number from 0 through 1000 and write pseudocode 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.

Bonus: Add pseudocode to check how many iterations must be made for each number entered by the user and, if you also complete Programming Challenge 7 in RAPTOR, you can compare the two values.