Moore’s Law states that Group of answer choices

“what can go wrong, will go wrong.”

“the decrease in the marginal output of a production process as the amount of a single factor of production is incrementally increased, while the amounts of all other factors of production stay constant.”

“processor speeds, or overall processing power for computers will double every two years.”

“programmers tend to set the size of problems to fully exploit the computing power that becomes available as the resources improve.”

A-12.3 an american spy is deep undercover in the hostile country of phonemia. in order not to waste scarce resources, any time he wants to send a message back home, he removes all the punctuation from his message and converts all the letters to uppercase. so, for example, to send the message, “abort the plan! meet at the dark cabin.” he would transmit given such a string, s, of n uppercase letters, describe an efficient way of breaking it into a sequence of valid english words. you may assume that you have a function, valid(s), which can take a character string, s, and return true if and only if s is a valid english word. what is the running time of your algorithm, assuming each call to the function, valid, runs in o(1) time?