Write a prolog recursive rule count(L, P, Z, N),

where L is a list of integers,

P is the number of positive numbers in L;

Z is the number of zeros in L;

N is the number of negative numbers in L;

Test case:

| ?- count([1,2,3,0,-2], X, Y, Z).

X = 3

Y= 1

Z = 1 ? ;