Please reference images below.

In Part 2 of the assignment you will analyze two algorithms, written in Java-like pseudocode, for calculating powers of real numbers: SP(x,n) // SP stands for "slow power" FP(x,n) // FP stands for "fast power" These algorithms both take two parameters: a non-zero real number called x, and a natural number called n. The algorithms do not perform any error checking of the values passed to them. They are simply assumed to be correct. These algorithms both return a real number which is xn Here is pseudocode for the algorithms: SP(x,n) FP(x,n) result = 1 if n==0 return 1 for (i=1; i