What is the best way of writing a Prolog rule that gives you all the possible coin combinations adding to a dollar?

What is the best way of writing a Prolog rule that gives you all the possible coin combinations adding to a dollar?


Answers:      
A. Use membership rules and arithmetic conditions.
B. Use sorting rules and selection conditions.  
C. Use nested repeat rules.  
D. Use recursion rules.

Answer. A.