Hi I am new to java and was given this problem.

1 . Each of the following are formulae for the number of operations in some algorithm. Express each formula in big-O notation.

A. 1024n + n²

B. The number of times n can be divided by 100 before dropping below 1.0

C. The number of digits in 5n²

D. (n+7)(n-2)( n² + 5n²)

E. n² + 5n²

2. A. Write the algorithm (not code) for a method that computes sum of the square of the numbers in an array. If the array's length is zero, the sum should be zero. B. Do a big-O analysis of your algorithm.