Use the following code to answer the questions on this page. void print(int arr[], int size, int curNode) { int main(){ int leftChild, rightChild; leftChild = curNode * 2 + 1; rightChild = curNode int arr[7] {3, 5, 1, 7, 6, 4, 2}; 2 + 2; print(arr, 7, e); if (leftChild >= size) { return; return 0; print(arr, size, leftChild); Example invocation list if it takes 3 recursive calls to complete and return to main. This is an example to show the ordered list, it is not for the above code. 0: print(arr, 24, 0) 1: print(arr, 24, 23) 2: print(arr, 24, 34) 3: print(arr, 24, 47) print(arr, size, rightChild); cout « arr[curNode] <« ' '; return; Q: (TOP RIGHT) Write a list, similar to above, containing all the function invocations performed by the given code. The number preceding the function call is the order of invocation. Use literal numbers for the third argument. 0: print(arr, 7, 0) Scratch notes can go in here or anywhere that isn't a solution box.