language in c++

Use a computational program or programs you have written to do these exercises. 1. We know that is (d”) when b and d are positive numbers with d 22. Give values of the constants C and k such that ” Cd whenever x >k for each of these sets of values: b = 10, d = 2; b = 20, d = 3; b = 1000, d = 7 2. Compute the change for different values of n with coins of different denominations using the greedy algorithm and determine whether the smallest number of coins was used. Can you find conditions so that the greedy algorithm is guaranteed to use the fewest coins possible? 3. Using a generator of random orderings of the integers 1,2….., find the number of comparisons used by the bubble sort, insertion sort, binary insertion sort, and selection sort to sort these integers. Show transcribed image text Use a computational program or programs you have written to do these exercises. 1. We know that is (d”) when b and d are positive numbers with d 22. Give values of the constants C and k such that ” Cd whenever x >k for each of these sets of values: b = 10, d = 2; b = 20, d = 3; b = 1000, d = 7 2. Compute the change for different values of n with coins of different denominations using the greedy algorithm and determine whether the smallest number of coins was used. Can you find conditions so that the greedy algorithm is guaranteed to use the fewest coins possible? 3. Using a generator of random orderings of the integers 1,2….., find the number of comparisons used by the bubble sort, insertion sort, binary insertion sort, and selection sort to sort these integers.

## Expert Answer

Answer to Use a computational program or programs you have written to do these exercises. 1. We know that is (d”) when b and d are…