In python algorithim The Greek Mathematician Euclid developed an algorithm named $"$gcd$"$ to

determine the Greatest Common Divisor $($GCD$).$ By developing an algorithm

for Lowest Common Multiple $($LCM$)$ named "lcm" that does not use the GCD$,$

provide an algorithm $"$gcd$\_$primes$\_$lcm" which given two numbers, uses the

algorithms $"$gcd$"$ and "lcm" and determines the Number of Prime Numbers

between the Greatest Common Divisor and the Least Common Multiple

$($LCM$)$ inclusive.

Using the algorithm$($s$)$ provided for section $($a$)$ of this question, illustrate how

your algorithm would find the Number of Prime Numbers between the

Greatest Common Divisor and the Least Common Multiple $($LCM$)$ exclusive

of $1925$ and $2695[$and$/$or $7096650$ and $9505210-$ Bonus $3$ marks$].$