COSC 311  Homework 10/12/2016  Use stack to find maximum nesting depth
Distributed: 10/12/2016
Due: 10/19/2016

Given a String of parenthesis delimiters ( '(' and ')' ), modify the stack 
algorithm that checks for matching delimiters to calculate the maximum nesting
level.

The string may have unmatched parentheses. In that case, return -1.

Examples: " (  ) "              --> 1
          " (  ( ( ) ( ) )  )"  --> 3
          " ( ( ( () ) ) ) "    --> 4
          " ( ()  ()  () ) "    --> 2
          " ) ) ( "             --> -1 
          "   "                 --> 0   
   
Constraints on the code:
  -- You may use Stack. You may use Java objects and classes for doing char
  stream I/O. You may not use any other Java objects and classes.
  -- Note: the input may have unbalanced delimiters. You must make use of the
  algorithm for matching delimiters.
    
Turn in:
  Hardcopy of your code.
  In your code, include a header:
      [your name]
      [URL of code]
      COSC 311
      HW 10/12
      FALL 2016.
  Do not supply UML diagram for your code.