Question: can you please solve this in C language not c# Assume that a full English name of a student consists of at least 2 words


can you please solve this in C language not c#
Assume that a full English name of a student consists of at least 2 words and each word starts with a capital letter. If the word has more than one character, then either the remaining characters are all small letters, or only followed directly by a dot. The dot can only appear at a word that is not the first nor the last word. Every two consecutive words is separated by a single space. Example: The following shows some examples of valid and invalid names: Suppose you have a file where each line contains a string. Task: Use grep to extract all lines that contain valid names
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
