Let n be a positive integer. Give a recursive algorithm for computing the sum of the first n positive integers by filling in the boxes in the procedure below with the expressions n, n – 1 or 1. Note:...

Extracted text: Let n be a positive integer. Give a recursive algorithm for computing the sum of the first n positive integers by filling in the boxes in the procedure below with the expressions n, n – 1 or 1. Note: You have to use some expressions more than once, but each box must contain only one of those expressions. procedure sum : positive integer) if then sum 1 else sum + sum