switches ditictors
Budget: $10 – $30 USD
we have to build a function that receives as input 5 strings so that the first four strings constitute 4 sentences, and the fifth string of the following form:
word -i, -n, -v, -x
So{ ?−, ?−, ?−, ?− } are called switches, in the fifth sentence it is not guaranteed that all switches will appear,
The program must print on the screen all the sentences in which the word word is found. In addition:
1. If ?− appears then the software should ignore the difference between lowercase and uppercase letters.
2. If ?− appears then the software prints before the sentence the order in which it was received.
3. If ?− appears then print the sentences in which only the word word is found without anything else
4. If ?− appears then print all the sentences where the word word does not appear instead.
word -i, -n, -v, -x
So{ ?−, ?−, ?−, ?− } are called switches, in the fifth sentence it is not guaranteed that all switches will appear,
The program must print on the screen all the sentences in which the word word is found. In addition:
1. If ?− appears then the software should ignore the difference between lowercase and uppercase letters.
2. If ?− appears then the software prints before the sentence the order in which it was received.
3. If ?− appears then print the sentences in which only the word word is found without anything else
4. If ?− appears then print all the sentences where the word word does not appear instead.