Write a function that returns true if the number of opening parenthesis is equal to the number of closing parenthesis in a string variable. Example: string str = "((x + 1)*y)" The number of opening parenthesis "("is equal to the number of closing parenthesis ")". Therefore, the function returns true in this case. The main methods you may need are: push(), pop(), top() and empty() Method prototype: void checkParenthesis(string str) Write a recursive function to compute the values of the following time series formula: T(n) = T(n - 1) + 2*T(n - 2) + 3*T(n - 3); if n > 3 T(1) = 1, T(2) = 2 and T(3) = 3 Deliverable: Source Code of each exercise. Write the code for each question using cpp.sh then generate a unique URL after compiling the code. Then include that URL in your Word or PDF Tile that you submit. Alternatively, you can paste screenshot of the source code of each question that you did using a C++ IDE such as Visual C++ or other. But do not write the code in word file directly