VIII Given the following recursive equations: Special (a, b)3* aSpecial (a, b-1) Special (a, 0)-4+2*a What is the value of: 1. Special(6,4) 2. Special(8,3) IX. Given a linear linked list with a pointer to the 6th node and a pointer to the last node (obviously there is also a pointer to the first node) make the 7th node in the list the last node in the list and the last node in the list the first node in the list. You may use in your code all the routines we used in class without writing them