For each of the following problems, propose the action/operation you would use to determine the time complexity (short answers are fine here).

a. Find x in a list of names

b. Transpose an n x n matrix M

c. Multiply two n x n matrices

d. Sort a list of numbers

e. Traverse (to display e.g.,) a binary tree (represented as a linked structure where each node contains pointers to its left and right children)