C# Programming

(Pythagorean Triples) A right triangle can have sides whose lengths are all integers. The set of three integer values for the lengths of the sides of a right triangle is called a Pythagorean triple (en.wikipedia.org/wiki/Pythagorean triple). The lengths of the three sides must satisfy the relationship that the sum of the squares of two of the sides is equal to the square of the hvpotenuse. Write an app to find all Pvthagorean triples for side 1, side2 and the hypotenuse, all no larger than 500Use a triple-nested for loop that tries all possibilities. This method is an example of "brute- force" computing. You'll learn in more advanced computer science courses that there are many interesting problems for which there's no known algorithmic approach other than using sheer brute force Sample Output: Pythagorean Triples 3, 4. 5), 4 3, 5), 6,8, 10), 8, 6, 10), 5, 12, 13), 12, 5, 13), 9, 12 15), 12 9, 15) 8, 15, 17), (15, 8 17), 12, 16. 20), 16, 12, 20), 7, 24 , 25), ( 15, 20, 25), (20, 15, 25), (24 , 7, 25). 10, 24, 26), 24, 10, 26), 20, 2 29), ( 2 20, 29), 18, 24, 30), ( 24, 18, 30), 16, 30, 34), 30, 16, 34) 21, 28, 35), 28, 21, 35), 12, 35, 37), 35, 12, 37) 15, 36, 39), 36, 15, 39), (24, 32, 40), 32, 24, 40) 9, 40, 4, (40. 9, 41), 27, 36, 45) 36, 27, 45) 14 48, 50), 30, 40, 50 40, 30, 50), 48, 14, 50) 24, 45, 51), (45, 24, 51), 20 48, 52) 48, 20, 52) 28, 45, 53), 45, 28, 53), 33, 44 55), 4 33, 55) 40, 42, 58), (42, 40, 58), 36, 48, 60 48, 36, 60) 11, 60, 61), (60, 11, 61), ( 16, 63, 65), (25 , 60, 65). 33, 56, 65), 39, 52, 65), (52, 39, 65), 56, 33, 65) 60, 25, 65), ( 63, 6 65), 32, 60, 68), 60, 32, 68) 42, 56, 70), 56, 42, 70) (48. 55, 73), ( 55, 48, 73) 24, 70, 74), 70, 24, 74), 21 72 75), 45, 60 75 60 45, 75), ( 72. 2 75), 30, 72, 78) 72, 30, 78) 48 64, 80), (64,48, 80), 18, 80, 82) 80, 18, 82) 13, 84, 85), 36, 77, 85), 40 75, 85), 51, 68. 85) 68, 5, 85), 75, 40, 85), 77, 36 85), 84, 13, 85) 60, 63, 87), ( 63, 60 87), ( 39, 80, 89) 80, 39. 89). keeps going