Submit the following files:

Part $0.$ Create a C$++$ class $3$DArray to store a multidimensional array of size n x m x l $,$ implement the corresponding constructor $3$DArray$($int n$,$int m$,$int l$)$ for the memory allocation, with the destructor.$$

Part $1.$ Write an iterative function and a recursive function to compute:

f$1($x$)=$i$=0$n$=100(2$i$+9)$

f$2($x$)=$i$=1$n$=100(5$i$3+$i$2)$

f$3($x$)=$i$=0$n$=500(5$i$)12$

Part $2.$ Determine the asymptotic notation using the big O and big Omega of the following expressions

f$1($n$)=5$n$3+10$n$2+600$

f$2($n$)=20$n$2+10$n$+$n$3$

The most important part is not the answer but the justification of the answer based on the definition. Reuse the definition to justify your answer.

Part $3.$ Implement the iterative version of the Fibonacci function:

void Fib$($int x$,$int$*$ result$)$

where x is the input and result is a pointer to the value we wish to return;

Example: