Provide the best algorithm for all the problems below. Write their running time functions using Big-O notation. a. Find the inner product of two vectors v1 and v2, each of size n.
b. Find the number of occurrences of an element t in a vector/array v, of size n.
c. Concatenate two strings, each of n characters long.
d. Remove the i-th element from a vector/array.
e. Find in a vector/array the sum of only those elements which are less than 43.
f. Add an element to the beginning/end of a vector/array v.