Problem: At college X, students and professors often use abbreviations for long titles of academic papers and projects. In this problem, you are asked to verify whether a given abbreviation matches the first letters of the words in a string, ignoring case. The abbreviation is valid only if it follows the exact order of the first letters of each word.

Examples:

For the words:
United Nations
united nations
United nations
united Nations

Valid abbreviations are:
UN, un, Un, uN

For the words:
Machine Learning college X

Valid abbreviations are:
MLIB (or any combination of upper and lowercase letters in the same order, such as mLiB).

Your Task

Main Program:

Write a C++ program that accepts four characters from the user and stores them in four character variables. Pass these characters to a function named isValidAbbreviation, which returns true if the abbreviation is valid, otherwise returns false. In the main function, print "yes" or "no" (lowercase letters) based on the returned value.

isValidAbbreviation Function:

1. Accept the words character by character as input.
2. Check whether the first letter of each word matches the corresponding abbreviation character (case insensitive).
3. Return false if there is any mismatch.
4. Return true if the entire abbreviation is correct.

To read character sequences with spaces:
First write:
cin >> noskipws;

Then a loop like the following may be used:
for (cin >> c; c != '\n'; cin >> c)

Output Format:

Print:
yes
or
no

accordingly.

Note:

- Do not print any extra messages such as:
  cout << "Enter a number";
  cout << "The computed answer is";
- Use cout only to print the final output.
- Do not print unnecessary spaces.
- Do not hard-code the solution.
- If any test case passes by simply printing with cout and without logic, marks will not be awarded.

Student submission:
#include<simplecpp>
#include <iostream>
char toLowerCase(char a){
    if((a>='A')&&(a<='Z')){
        return a-'A'+'a';
    }
    else{
        return a;
    }
}
bool isValidAbbreviation(char s1, char s2, char s3, char s4){
    char f1,f2,f3,f4,c;
    char prev=' ';
    int k=1;
    cin>>noskipws;
    for(cin>>c;c!='\n';cin>>c){
        if((k==1)){
            f1=c;
            prev=c;
            k++;
        }
        if((k==2)&&(prev==' ')){
            f2=c;
            prev=c;
            k++;
        }
        if((k==3)&&(prev==' ')){
            f3=c;
            prev=c;
        }
        if((k==4)&&(prev==' ')){
            f4=c;
            prev=c;
        }
        prev=c;
    }
    
    
    s1 =toLowerCase(s1);
    s2 =toLowerCase(s2);
    s3 =toLowerCase(s3);
    s4 =toLowerCase(s4);
    f1= toLowerCase(f1);
    f2= toLowerCase(f2);
    f3= toLowerCase(f3);
    f4= toLowerCase(f4);
    if((s1==f1)&&(s2==f2)&&(s3==f3)&&(s4==f4)){
        return true;
    }
    else{
        return false;
    }
    
}


main_program{
    char a,b, c, d;
    cin>>a>>b>>c>>d;
    
    if(isValidAbbreviation(a,b,c,d)){
        cout<<"yes";
    }
    else{
        cout<<"no";
    }
    
}

Grading criterion: Checking the first letter of a word
Rating A: Correctly implements an algorithm for checking the first letter of a word

Rating B: some issue
Rating C: major isuue
Rating D: 0
Assigned grade: A