Please show work! 1. Assume that you are assigned a programming project which requires the time complexity of O(n²). If your program's basic operation runs (2*n²*logn + 3*n² + 5) times, can you say that your program meets the project requirement.

2. Read the following pseudocode carefully and answer to the following questions. Algorithm DoSomething (A[0..n-1]) 1. for i <- 0 to n -2 do 2. for j <- i + 1 to n - 1 do 3. if A[i] == A[j] 4. return false 5. return true (a) Time complexity of the algorithm is (n²) (b) Time complexity of the algorithm is O(n)