Construct a DFA with at most 10 states that accepts the set of all strings over the alphabet Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} that are over 9000 (!!!) when interpreted as base 10 integers. Note that the only string starting with 0 that represents a valid integer is 0. Specifically, 0999999999 should not be accepted because it starts with 0. Also, over is strictly larger, so 9000 should be rejected.

Number of megabytes of ram in a computer. qualitative or quantitative? because

Write a function processpeople() that takes the name of a file as a parameter. each line of the file corresponds to information about a person. in particular a line contains either a name (in the form lastname,firstname with no spaces in it) or a name (lastname,firstname) and a year. the function will process the file, creating a person object for each line in the file. the function will print information about each line as it processes it, as well as appending the new person object into a list. make sure to use person methods to display information rather than recreating the work you did for the first problem. once the entire file has been processed, the function returns the list of person objects created from the file. if the file is empty, the function should return an empty list. if the input file cannot be opened, the function should print a message to that effect and then return an empty list. the following shows what would be displayed for two example files which have been provided in the link. the file none.txt does not exist. note that your function must work on an arbitrary file that consists of valid lines. you cannot assume anything about the file except that it contains lines that have the format described above.

Amedian in the road will be marked with a white sign that has a black arrow going to the left of the median. true false