Haskell how to count occurance of an element in a list recursively?

Question

I\'m trying to recursively count how many times a given element (number) appears in a list.

For example, equals 2 [1,2,3,2,1,2,3] should return 3 for the num