Using Java
A. Write a clear algorithm pseudocode. The algorithm takes two arrays of n integers, A[] and B[], and an empty array C[], and finds all instances where an integer in A[] is duplicated in B[] and then places the duplicates in C[]. Use only pseudocode loops, the arrays, indexes, and basic relational/assignment operators.
B. What is the basic operation of the algorithm?
C. What is the efficiency class of your algorithm in the best and worst case? Explain why.
D. Write a summation formula for the number of basic operations in Problem A. Solve it and find the closed-form equation for the algorithm.
E. Show using the definition that 2n^2 - 40 ∈ Θ(n^2)