Write the java program:

A right triangle can have sides whose lengths are all integers. The set of three integer values for the length of the sides of a triangle is called a Pythagorean triple. The length of the three sides must satisfy the relationship that the sum of the squares of the sides is equal to the square of the hypotenuse.

Write a Java application that prompts the user for an integer that represents the largest side value and displays a table of the Pythagorean (valid) triples for side1, side2, and the hypotenuse. Remember the maximum side value in the table cannot be bigger than what the user entered. Use a triple-nested loop that tries all possibilities. This problem is an example of brute-force processing. Brute-force processing provides a solution to many computing problems where no more efficient algorithm exists, which you will learn more about in future computing classes.

For example, if the user enters 10, the below table will be printed: ****NOTE YOU DONT HAVE TO DRAW THE LINES ONLY NUMBERS

Side1	Side2	Hypotenuse
3	4	5
4	3	5
6	8	10
8	6	10

Please keep in mind that your program will rule out many of the other options. For example, the below options are ruled out (among many more):

Side1	Side2	Hypotenuse
1	1	1.414213562
1	2	2.236067977
1	3	3.16227766
1	4	4.123105626
1	5	5.099019514
1	6	6.08276253
1	7	7.071067812
1	8	8.062257748
1	9	9.055385138
1	10	10.04987562
2	1	2.236067977
2	2	2.828427125
2	3	3.605551275
2	4	4.472135955
2	5	5.385164807
2	6	6.32455532
2	7	7.280109889
2	8	8.246211251
2	9	9.219544457
2	10	10.19803903