Write a program in C++ which reads a string and stores it a character at a time in a list implemented using the array-based list ADT. The program will then determine whether the parentheses in the list are balanced and properly nested. For example, the string "((())())()" contains properly nested pairs of parentheses, but the string ")()(" does not, and the string "())" does not contain properly matched pairs. The output should indicate the position where the first offending parenthesis is found if the string is not properly nested and balanced. Use a stack to track the left parenthesis.