Consider a frame of bowling pins shown below, where each * represents a pin:There are five...

Consider a frame of bowling pins shown below, where each * represents a pin:

There are five rows and a total of fifteen pins.

If we had only the top four rows then there would be a total of 10 pins.

If we had only the top three rows then there would be a total of 6 pins.

If we had only the top two rows then there would be a total of 3 pins.

If we had only the top row then there would be a total of 1 pin.

Write a recursive function that takes as input the number of rows n and outputs the total number of pins that would exist in a pyramid with n rows. Your program should allow for values of n that are larger than 5