RESTRICTIONS-: Must be done in Python 3 with logical operations, arithmetic operators, if statements, and recursion. NO LOOPS

Write a function count_prime_divisors(n) which returns the number of prime divisors of a given positive integer n. Do not count multiplicity of these divisors. Due to recursion limitations, your code will not be tested on numbers larger than 100. Do not hard code all 100 cases (marks will be deducted for codes that do not use recursion). Sample: count-prime divisors (12) => 2