Write a pseudocode algorithm to compute the product of the first n positive integers.
How many multiplications does your algorithm perform?
Since, the first positive integer is 1 and the product with itself is also 1, we set “x” as 1. Accounting to the next sequence of integers from 2 to n, and let each of these numbers be represented by i.
Thus, in order to get the product of the