Discrete mathematics for Computing

Please show all work. thanks

TOUUUI IUI Juui aliswer. 11. Write an algorithm to input a string of characters and test whether the parentheses (round brackets) in the string are paired correctly. (Use a variable excess_left, which records the excess of the number of left parentheses over the number of right parentheses as the algorithm looks at each character in turn. If excess_left is never negative, and the end of the string is reached with excess_left = 0, then the parentheses are paired correctly.) 12. Write an algorithm that takes a passage of text (as a string of characters) as input, and outputs the number of words in the passage. Assume that each word is separated from the next word by one or more spaces. In particular, the algorithm must work correctly if the passage begins or ends with one or more spaces.) iBooks