Computational thinking: Recursion] In class, the Tower of Hanoi puzzle was studied with a focus on computational thinking for a recursive algorithm. Consider the following recurrence equation: M(n) = M(n-1) + 1 + M(n-1) for n > 1 and M(1) = 1, where "n" is the number of disks. Note that the first term Mn-1) (i.e., highlighted in bold) represents the movement of the topmost n-1 disks from the source to the intermediary (or auxiliary) peg. a) 11%) Find the basic operation. Subtraction Movemt ola di b) [5%] For "n" = 4, what is the total number of basic operations corresponding to the first term M(n-1)? 3 4.1 Sams c) [4%) For "n" = 4, draw the diagram that shows the location of all diele the diagram that shows the location of all disks corresponding to both the first term (i.e., Mn - 1) and the second term ..M(n-1) and the second term (i.e., "1"). [Notation: four disks the size of "a" > size of b> size of "c"> size of "d"). {a, b, c, d], where the size of "a" > size of "b" > size - The End; Thanks for you