(a) The next section will guide you to the solution of the following problem: Call a number primish if it is composite but not divisible by 2, 3, or 5. The three smallest primish numbers are 49, 77, and 91. There are 78,498 prime numbers less than 1,000,000. How many primish numbers are there less than 1,000,000? i. For any positive integers n and m, the number of integers divisible by m which are less than n is Answer for (i): ii. How many numbers are divisible by at least one of 2, 3, 5? Do not write code to solve this problem. Use part i), instead! (and please show your work!) Answer for (ii): iii. Finally, use part ii) to answer the original question. Again, show your work. Answer for (iii)