Local server so you can all you use if you guys are near
The answer is built-in dictionary.
Most Microsoft Word versions come with a built-in dictionary for standard grammar and spellings. These dictionaries are not comprehensive. Word also has an additional option to add a spelling error to the dictionary so that the next time you type that same error, it will not come up as a spelling error. In addition, Word can use multiple custom dictionaries that allows you to supplement with the main dictionary and check the spelling of your documents.
Answer: True
Explanation:
A language is said to be closed under a operation here the complement is the operation then if upon application of that operation to any members of that language always yields a member of that language.
regular languages are closed under complement. A proof of the statement is
If a regular language 'L' is regular then there is a DFA X recognizing that regular language 'L'. to show that L' (compliment) is regular we need to have another DFA X' recognizing L'.
The initial state and transition function of both the DFAs are same except their accepting state. Then we can say that X' accepts L'.
So, we can say that regular languages are closed under complement.
The question is vague, but answer B is absolutely incorrect so by default choice A is correct ... "good" is hard to define and your vision can be corrected by glasses allowing you to drive, etc.