1. A non-negative integer is called heavy if the average value of its digits in decimal representation exceeds 7. For example the number 8698 is heavy, because the average value of its digits equal to (8+6+9+8)/4 7.75 Given two non-negative integers A and B, ind the number of heavy integers in the interval [A. (A and B included). What is O of your algorithm,2 a. What if A and B are integers within the range [0 200,000,000]. (fit in a long int). b. What if A and B are arbitrarily largei? c. Is this a computational problem? A decision problem? Why