please answer all for rating i am very confused

For each of the following problems, propose the key "action/operation" you would use to determine the time complexity (short answers are fine here). What is the smallest time complexity of an efficient algorithm solving that problem. a. (3 points) Consider an n x n matrice B(bij) where i and j vary from 1 to n. The problem is to compute the trace of Matrix B & bii i.e., adding the elements of the matrix diagonal. Key action operation is smallest time complexity is b. (3 points) Consider a sequence A containing n real numbers. The problem is to find the number of occurrences of a real b in Sequence A. Key action/operation is... smallest time complexity is C. (3 points) Given an integer n, and real numbers a and xcompute !=o a xi Key action/operation is smallest time complexity is d. (3 points) Given an integer n, compute IT:=1 i (Product on the n first integers) Key action/operation is smallest time complexity is e. Given an integer n, convert and display n in base 11. | Key action/operation is smallest time complexity is