Pascal's triangle is the name given to the following numerical arrangement. Each number inside the triangle is the sum of the two numbers above it, while the numbers on either side of the triangle are all 1. Create a method that uses a recursive algorithm to calculate the components of Pascal's triangle. Notation: Your function must generate five rows of the Pascal's triangle and return (1 2 4 8 16) as the total of the elements for each row.

111121133114641