please do questions 4,5 Show all work

yes please both questions 4 and 5 in psuedo code and flow charts. For problem 5, assume that the programming language understands what mean, median, mode, etc. are, you do not have to write the actual steps to do the calculation for each statistic.

Problems for Psuedo Code and Flowchart 1. Make a peanut butter sandwich. 2. Calculate the value of n! Do not use the factorial fn, use the actual recursive definition**. 3. Draw a deck of cards from a standard deck of 52 cards until the queen of hearts is drawn. How many cards did you draw? 4. Fibonacci Numbers. The Fibonacci Numbers are an interesting sequence of positive integers where each value is the sum of the previous two values. We begin with F1 = F2 = 1. This is known as the seed. Each successive value is then obtained from the formula F, = F/.+ F1-2, for = 3, 4, 5 .... Find and list the first 25 Fibonacci numbers. This is an example of a recursive function. 5. Given the heights of 7 engineering students, H1, H2, H3, H4, H5, H6, H7. Find the mean, median, mode, min, max, variance and standard deviation. **A recursive function uses previous values of itself to find the current value. So for n! where n-4, the formula would be n!4 = n!3 * 4