A programmer writes an efficient program to sum two square diagonal matrices (matrices with elements only on diagonal). The size of each matrix is nXn. What is the time complexity of Vrinda's algorithm?
A. θ(n^2)
B. θ(n)
C. θ(n*log(n))
D. None of these
Answer: Option 2