///////////NEED IT IN .RKT FORMAT//////////////WILL UPVOTE FOR CORRECT ANSWER/////////

The following pattern of numbers is called Pascals triangle. The numbers at the edge of the triangle are all 1, and each number inside the triangle is the sum of the two numbers above it. Write a procedure that computes elements of Pascals triangle by means of a recursive process. Note: Your function should produce 5 rows of Pascals triangle and should return (1 2 4 8 16) as sum of elements for each row

111121133114641