let ∑ ={a,b} construct the DFA that accepts of all Strings ending in bab

#include<bits/stdc++.h>using namespace std;bool isPalindrome(string &s){    int start=0;    int end=s.length()-1;    while(start<=end)    {        if(s[start]!=s[end])        {            return false;                    }        start++;        end--;    }    return true;}int main(){    string s;    cout<<"ENTER STRING:";    getline(cin,s);    int n=s.length();    bool flag=true;    for(int i=1;i<n;i++)    {        string lowerHalf=s.substr(0,i);        string upperHalf=s.substr(i,n-i);      if(isPalindrome(lowerHalf) && isPalindrome(upperHalf))      {          flag=false;          cout<<"String A is:"<<lowerHalf<<"\n";          cout<<"String B is:"<<upperHalf<<"\n";          break;      }    }    if(flag)    {        cout<<"NO\n";    }    return 0;} change to stdio.h string.h

Specification: Read sentences from the user until * is entered. Show the number of words in each sentence that contain a stretch of non-z characters with exactly 2 vowels. A stretch starts from the start of the word or after a 'z'. A stretch terminates just before another 'z' or at the end of the word. Examples: 1. Matching words: zoo, azozooza, GONZALEZ 2. Non-matching words: ozo, azoooza The sentences contain no punctuation, the words are separated by one or more spaces, and the characters may be upper or lower case. Keep reading sentences until the user enters "*". Sample I/O: Sentence: azoooza azooza zoo azoo Matching words = 3 Sentence: GONZALEZ passes the ball to VAZQUEZ Matching words = 3 Sentence: azozototzeti Matching words = 1 Sentence: * Done