Again assume that function isSmooth(n) is available. Write a C++ definition of function someSmooth(m, n), which returns true if at least one of m, m+1, m +2,..., n is a smooth integer, and returns false otherwise. Use a search algorithm for someSmooth. As soon as your algo- rithm finds that a number is smooth, it must not ask whether any other integer is smooth. Use a loop for this problem, not recursion. A heading is given