In the programming language racket, please provide a solution to the following problem.

In each of the following problems you can assume the following data definitions:

M $->()|($A $.$ M $)|($M $.$ M $)$

L $->()|($A $.$ L$)$

A $->$ atom

You may assume that all numbers are integers greater than or equal to $0$ and that all data fits the specified format unless specified otherwise. Each problem is worth $5$ points. Some of you may find the built$-$in function append helpful for a problem or two. For example, $($append $($a b$)($c d$))$ results in $($a b c d$).$

Give a Scheme solution to the following function specifications:

$2.($count$-$parens$-$all M$)$ counts the number of opening and closing parentheses in M$.$

$>($count$-$parens$-$all $())$

$2$

$>($count$-$parens$-$all $(($a b$)$ c$))$

$4$