1. Write the pseudocode that represents the code (No code allowed) 2. Create a table of steps to describe how the pseudocode behaves for any given n. Show all work. 3. Compute the complexity function of your algorithm T(n), and based on your complexity, state the worst case time complexity using Big O notation. Show all your work, including step by step computation of the summations. 4. Provide an optimization for your algorithm. Write the pseudocode and compute the complexities for your optimization.] en int n = 2* + where x is an even int > 2 For (int i = 1; i