C#

With steps Please

A4-Ex3: (Pythagorean Triples) This is another Console Application based on Deitel textbook #6.21. However, you can use WinForm with a scrollable TextBox (https://www.youtube.com/watch?v=euT68g1maes) 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 hypotenuse. Write an app to find all Pythagorean triples for side1, side2 and the hypotenuse third side), all no larger than 500. Use a triple-nested for loop that tries all possibilities. This method is an example of brute-force computing. There are many interesting problems for which theres no known algorithmic approach other than using sheer "brute force". Important! Add a total counter to count the number of found triplets.