Write a Java application Project2_PythagoreanTriples_YourName.java to find all Pythagorean triples for side1, side2 and the hypotenuse, all no larger than 500. Use a triple-nested for loop that tries all possibilities. This method is an example of brute-force computing.

SAMPLE OUTPUT Below

--------Configuration: - #1 : side1: 3, side2: 4, hypotenuse: 5 #2 : side1: 4, side2: 3, hypotenuse: 5 #3 : side1: 5, side2: 12, hypotenuse: 13 #4 : side1: 6, side2: 8, hypotenuse: 10 #5 : side1: 7, side2: 24, hypotenuse: 25 #768 : side1: 480, side2: 31, hypotenuse: 481 #769 : side1: 480, side2: 88, hypotenuse: 488 #770 : side1: 480, side2: 108, hypotenuse: 492 #771: side1: 480, side2: 140, hypotenuse: 500 #772 : side1: 483, side2: 44, hypotenuse: 485 Process completed