WRITTEN IN SCHEME

Define the function count, which takes two s-expressions, and counts the number of times the first s-expression occurs in the second.

Use recursion for this problem.

> (count 7 '(1 7 2 8 4 7 0 7)) 3 > (count '(1 2) '((1 3) 1 2 (1 2) (1 2))) 2