Write down the recurrence equation for the well-known minimum Coin Change Problem. In other words, give change for amount using the minimum number of coins of denominations
! < " < ⋯ < #.
Example:
Input: coins[ ] = {5, 10, 25}, n = 30
Output: Minimum 2 coins required
Coin used: 5 and 25 cents
Input: coins[ ] = {1, 5, 6, 9}, n = 11
Output: Minimum 2 coins required
Coin used: 5 and 6 cents

Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.

What type of file does a cookie place on web site visitors' computers so that web site managers can customize their sites to their visitors' preferences?

Suppose an astronomer discovers a large, spherical-shaped body orbiting the sun. the body is composed mostly of rock, and there are no other bodies sharing its orbit. what is the best way to categorize this body? a. planet b. moon c. comet d. asteroid