(Pythagorean Triples) A right triangle can have sides that are all integers. The set of three integer values for the sides of a right triangle is called a Pythagorean triple. These three sides must satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the hypotenuse. Find all Pythagorean triples for side1, side2, and the hypotenuse all no larger than 500. Use a triple-nested for loop that simply tries all possibilities. This is an example of "bruteforce" computing. It is not aesthetically pleasing to many people. But there are many reasons why these techniques are important. First, with computing power increasing at such a phenomenal pace, solutions that would have taken years or even centuries of computer time to produce with the technology of just a few years ago can now be produced in hours, minutes or even seconds. Recent microprocessor chips can process a billion instructions per second! Second, as you will learn in more advanced computer science courses, there are large numbers of interesting problems for which there is no known algorithmic approach other than sheer brute force. We investigate many kinds of problem-solving methodologies in this book. We will consider many brute-force approaches to various interesting problems. Example Output:

3 4 5

4 3 5

5 12 13

6 8 10

7 24 25

8 6 10

476 93 485

480 31 481

480 88 488

480 108 492

480 140 500

483 44 485

A total of 772 triples were found.

{NEED TYPED. write 1 -C program codes using C program through putty program only , 2- flowchart snd pseudocode, 3- screen shot of the output from putty program.}