Assume we have a right triangle with sidelengths a,b,c such that a <= b < c (i.e. c is the longest side). The rule of Pythagoras states that a^2 + b^2 = c^2. One example is a = 3, b = 4, c = 5. Write a Python program that, given an upper limit of c, prints out all possible combinations of a,b and c so that the following conditions hold: a^2 + b^2 = c^2 a <= b b < c c <= c_max The lines should be printed as sorted by a, b and then c. So the line with the lower value of a is before higher a. If two lines have the same value of a, the line with the lower b appears first, and so on. However, do not use "sort", you should make sure the lines are printed out in the right order by organizing the for-loops in the right way. Examples: Upper limit for the longest side: 30 3 4 5 5 12 13 6 8 10 7 24 25 8 15 17 9 12 15 10 24 26 12 16 20 15 20 25 18 24 30 20 21 29 Upper limit for the longest side: 10 3 4 5 6 8 10 Upper limit for the longest side: 100 3 4 5 5 12 13 6 8 10 7 24 25 8 15 17 9 12 15 9 40 41 10 24 26 11 60 61 12 16 20 12 35 37 13 84 85 14 48 50 15 20 25 15 36 39 16 30 34 16 63 65 18 24 30 18 80 82 20 21 29 20 48 52 21 28 35 21 72 75 24 32 40 24 45 51 24 70 74

25 60 65 27 36 45 28 45 53 28 96 100 30 40 50 30 72 78 32 60 68 33 44 55 33 56 65 35 84 91 36 48 60 36 77 85 39 52 65 39 80 89 40 42 58 40 75 85 42 56 70 45 60 75 48 55 73 48 64 80 51 68 85 54 72 90 57 76 95 60 63 87 60 80 100 65 72 97