The functional program elements in Unit $3$ can be used to develop a program without traditional looping and selection constructs. The dataset of interest are a list of closed polygons represented by a list of their sides. So for example the list $[2,4,2,4]$ is a $2$x$4$ rectangle, and $[3,4,5]$ is a right triangle.

Write a program in Python that exercises the functional higher order functions to compute the perimeter of only the RIGHT triangles in the list. These higher order function may be implemented either using the actual function names $($map$,$filter,reduce$)$ or their Python list comprehension equivalents. The program should be composed of the following elements.

Embed a list of polygons into your program. The list must have a minimum of $5$ polygons, with at least $2$ RIGHT triangles and $1$ non$-$RIGHT triangle in the list.

Write a function named poly$\_$sum$($polygon$)$ that returns the perimeter of the given polygon. So for example the rectangle $[2,4,2,4]$ as input to this function would return $12,$ which is the sum of the $4$ sides. Note that this function must be constructed only using the higher order functional elements outlined in the Unit. Use reduce to generate a sum of those sides.

Use the standard filter function $($or list comprehension equivalent$)$ to generate a list of only the triangles in the original polygon list.

Use a second filter function $($or list comprehension equivalent$)$ to select only the right triangles. A right triangle fulfilles the criteria that a$2+$ b$2=$ c$2$ where c represents the longest side of the triangle. You will need to write a function that generates this test to use with the filter.

Use the standard map function $($or list comprehension equivalent$)$ to compute the perimeters of the RIGHT triangles from the previous step using poly$\_$sum as the transformer.