This question concerns the and boolean operator of Scheme, which has variable arity and uses lazy evaluation. (a) (5pt) Define a binary operator, bin-strict-and, that corresponds to strict evaluation of and. (b) (5pt) Give a concrete example where and works and bin-strict-and does not, that is, (and x y) produces a value whereas (bin-strict-and x y) gives an error. (c) (10pt) Define an operator, strict-and, that corresponds to strict evaluation of and. This operator has variable arity. You are not allowed to use imperative features of Scheme. This question concerns the and boolean operator of Scheme, which has variable arity and uses lazy evaluation. (a) (5pt) Define a binary operator, bin-strict-and, that corresponds to strict evaluation of and. (b) (5pt) Give a concrete example where and works and bin-strict-and does not, that is, (and x y) produces a value whereas (bin-strict-and x y) gives an error. (c) (10pt) Define an operator, strict-and, that corresponds to strict evaluation of and. This operator has variable arity. You are not allowed to use imperative features of Scheme.