1. Name five primitive operations that we usually use for algorithm analysis. 2. What is data dimension? List and define each category of data dimension. 3. What is the time and space complexity of an algorithm? Apply your definition to the following function and explain the time and space complexity of this code. def getSum (myList): sum = 0 for row in myList: for item in row: sum += item return sum 4. Order the following functions by asymptotic growth rate. 4nlogn+2n 210 2logn 3n+ 100 logn 4n 2" n +10n n nlogn