Android development. 1. Modify the toolbar of the ContactActivity to display the proximity sensor readings. Add the proximity sensor service so that this works.
2. Modify the app so that when the user long-clicks the cell number of a contact, the text messaging service is opened instead of the phone service. You will have to have a permission in the manifest to send text (SMS) messages.
3. Modify the app to display an incoming text message as a Toast. You will have to register your app with a permission to read text (SMS) messages and set up a listener for text messages.
4. Modify the compass to report NW, NE, SE, and so on in addition to the N, W, S, and E headings.

Write 150 words on what kind of website would you like to make in the future? what sites would you like to model yours after?

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.

Simon says is a memory game where "simon" outputs a sequence of 10 characters (r, g, b, y) and the user must repeat the sequence. create a for loop that compares the two strings starting from index 0. for each match, add one point to userscore. upon a mismatch, exit the loop using a break statement. assume simonpattern and userpattern are always the same length. ex: the following patterns yield a userscore of 4: simonpattern: rrgbryybgy userpattern: rrgbbrybgy