Write a program that simulates throwing a die n times. The program will read the number of times to throw the die and display the throws. Each throw is represented by 9 characters where we use 0 or . (see sample run below). To generate random values, you need to create a Random object with a seed value that corresponds to the number of dies to throw. Use the method nextInt (with 6 as the argument) in order to generate integer random values between 0 and 5; just add 1 to the result to generate the die face. The following example illustrates the messages to use to read data and to display results.

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.

Is an attack that relies on guessing the isns of tcp packets

Leo is a recruitment executive for a large company. he has identified new labor resource requirements in both the marketing and production departments. what should be his first step in recruiting candidates for the positions? a. conduct background checks of candidates b. make job offers c. arrange interviews d. conduct reference checks e. place job ads on job sites