Suppose following bills are available in infinite amount. Do you think greedy [CO1, algorithm works here for making change? If not provide a counter example with Marks: 8] proper explanation. 1, 2, 5, 10, 20, 70, 200, 500, 700, 1000 Consider the following String S and Pattern P. Apply Rabin-Karp algorithm to find [CO2, C3, the each occurrence of pattern P in string S. Marks: 5] S=0011001011000101 P = 1100 Use Horner's rule for generating integer.