Write a Haskell program numBulls that takes as input two positive integers as input and returns -1 if either the two integers have different number of digits or either of them have repeating digits. However, if the two integers have the same number of digits and also do not have any repeating digits, the function returns the number of digits that match in the exact same positions in the integers.

In C++, m%n is the remainder when the integer m is divided by the integer n. We can define a function to test whether an integer is even as follows: bool even(int k) {   if ( k % 2 == 1 )      return false;   else      return true;} Translate this function into a standard mathematical function specification.

In Haskell: Code a function "rangeProduct" that takes two arguments. The function should return 0 if the second argument is smaller than the first, otherwise it should return the product of the range between two numbers, ex: rangeProduct 3 5 --> 60 (because 3*4*5 = 60) What to do for negative numbers to do (if anything) is up to you. Write the program without recursion first and then write it with recursion.

Write a function that displays all the numbers between two integers in n lines, that are divisible by 5 or 7 (not by both). So, the function should take as parameters the minimum and maximum of integer numbers and n. If no values are passed to them, this function should display the numbers between 1 and 100 in 10 lines. Write a test program to test your function.  just in C++