and append$).$ In general, no library functions will be required. Do not use Prolog constructs that we have not covered $($such as $->).$

$10\%$ : Write a predicate count$\_$multiples$/3.$ Its first argument is a list which must be instantiated $($bound$),$ its second argument is a positive integer which must also be instantiated, and its third argument will be bound to an integer representing the number of value in the list that are multiples $($evenly divisible$)$ by the second argument. Zero is considered a multiple of all other integers. This must not be tail$-$recursive.

$10\%$; Write a predicate count$\_$multiples$\_$tr$/3$ that is a tail recursive version of count$\_$multiples. Note that this predicate will have to call another predicate with additional arguments.