Write and certify a recursive scheme r5rs procedure check which inputs an sexp s and a list varlst ; of identifiers and decides whether s belongs to the class of fully ; parenthesized infix +-expressions fpip defined as follows:

; var ::= a | b | c | d | e | f | g ; fpip ::= var | (fpip + fpip)