Inspired by this question. Same challenge as the original, but with a regular pentagon instead!
Copied below for reference (with changes to shape and numbers):
How can you dissect a regular pentagon into five non-self-intersecting congruent polygons such that each polygon has the same perimeter length as the given regular pentagon?
The goal is to have minimal number of edges per polygon.
Bonus question: Find a numerical representation of the pentagon and polygons in addition to a theoretical dissection.
