Given four points in 2D, P1=(0,7), P2=(1,-12), P3=(7,0), P4=(10,-9), solve the following problems:

I don't even know where to start with this one:(

 Write a procedure PRIME_BRACKET that takes as input any positive real number (not just an integer) and finds the smallest prime number larger than or equal to the input.

How would I do the following?

1. Write a procedure MY_MAX to compute the maxiumum numerical number of a list L, which may contain ANY type of expressions. If there is no numerical number in L then return ERROR.

2. Write a procedure PRIME_BRACKET that takes as input any positive real number (not just an integer) and finds the smallest prime number larger than or equal to the input.

1. Write a procedure to implement this function:
p(n)= x^n – 2^x cos(x), if n<5
nx + arcsin(x), otherwise.
 
2. Plot two functions in Q1, when n=2 and n=5, both when x is in the interval [0, 5].
 
3. Write a procedure to implement:
Input: 1-dimensional Array: X
Output: X’s mean and variance
You should use two output params to store “mean” and “variance”.
 

1. Write a do loop to store the first 50 Fibonacci numbers in a 1-dimensional array:
 A_Fib. (p.s. F(n)=F(n-1)+F(n-2), initially, F(0)=0, F(1)=1).
 
2. Write a linear transformation of A_Fib in Q1: B_Fib=2*A_Fib+5.
 
 
3. Use the procedure in Q5, to calculate the mean and variance of B_Fib in Q2.

**I can't use Maple shortcuts like "sum" to sum up all the numbers in a sequence, etc. **