[solved] – Question 8708

difficult exercise in racket sheme programming??????????
A function named occurrences that takes as parameters two arguments, a and b. If a is not a list
then the function should return #f. Otherwise it should return the number of times b is found in
the list a. For example, if a is (3 4 2 53 3 5 4) and b is 3 the function should return 2

Expert Answer

---