1. [7 marks For this question, we will be counting primitive operations, as described on slides 22-23 of Lecture 7. The following list describes all of the primitive operations: comparisons: ,,== arithmetic: +,-,*,/ read a variable's value from memory, assign a value to a variable apply the floor function | Your task: Determine the total number of times a primitive operation is performed when Algorithm 1 is executed. In particular, your answer should be a function t(n) defined by a formula in terms of n. Your function can be defined using cases depending on whether n is even or odd. Algorithm 1 1: ito 2: while i ,,== arithmetic: +,-,*,/ read a variable's value from memory, assign a value to a variable apply the floor function | Your task: Determine the total number of times a primitive operation is performed when Algorithm 1 is executed. In particular, your answer should be a function t(n) defined by a formula in terms of n. Your function can be defined using cases depending on whether n is even or odd. Algorithm 1 1: ito 2: while i