Write recursive Dr Racket functions to do the following. The functions should work on all types of lists( not just simple lists of atoms). Document (via direct Dr Racket screens/outputs) both your code and the results of running the test cases.

a) Count how many times an item (atom) appears on a list.

Minimum test cases:

(count 3 '(1 5 6 7 8 3 2 3 )) returns 2

(count dog '(cat bird cat dog frog)) returns 1

(count a '(a(a b ) (c (b c)) ((a))b)) returns 3

(count 3 '(1)) returns 0

(count none '()) returns 0