Consider the following basic definition of a factorial function for any positive integer: Factorial (n) = n* (n-1) *...... * 1. For example, Factorial(4) = 4 * 3 * 2 * 1 = 24. Factorial (0) = Factorial (1) =1. Write informal pseudo code or alogorithm to compute factorial of any positive integer. 1) using iterative (repeat) structure 2) using recurusive structure Which is an example of top-down or bottom-up structure? How do you assess correctness of your pseudo code (hint: what is the loop invariant, condition?)