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.

An ou structure in your domain has one ou per department, and all the computer and user accounts are in their respective ous. you have configured several gpos defining computer and user policies and linked the gpos to the domain. a group of managers in the marketing department need different policies that differ from those of the rest of the marketing department users and computers, but you don't want to change the top-level ou structure. which of the following gpo processing features are you most likely to use? a, block inheritance b, gpo enforcement c, wmi filtering d, loopback processing

You draw two cards from a standard deck of 52 cards, but before you draw the second card, you put the first one back and reshuffle the deck. (a) are the outcomes on the two cards independent? why?

Create a program that will take in a single x and y coordinate as the origin. after the input is provided, the output should be all of the coordinates (all 26 coordinates read from the “coordinates.json” file), in order of closest-to-farthest from the origin.