c code

Problem 5: In this problem, we are interested in finding right triangles. In general, a triangle is a right triangle if the square of the hypotenuse c is equal to the sum of the squares of the other two sides a and b, i.e. c2=a2+b2. Write a program that displays all the right triangles having the sides a,b and c ranging between 1 and N. Hence, you need first to prompt the user to enter the integer N and then display all the right triangles without duplicates having the sides a, b and c ranging between 1 and N as shown in the sample input/output below: Sample input/output: Please an integer N : 40 The right triangles having sides ranging between 1 and 40 are: (3,4,5) (5,12,13) (6,8,10) (7,24,25) (8,15,17) (9,12,15) (10,24,26) (12,16,20) (12,35,37) (15,20,25) (15,36,39) (16,30,34) (18,24,30) (20,21,29) (21,28,35) - Submit your solution in a file called "Problem5.c