Write Context Free Grammers for: All strings having even a’s and odd b’s All strings that start and end with different letters anbn

#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

Write a function named contains-double in Scheme that takes a list as input and returns true if an item every appears twice in a row. You may assume the list is flat (i.e., no nested lists).

The following two languages over {0,1} L1: All strings that begin in '00' L2:  All strings that have the substring '1' embedded.

5. Design an FSM over the alphabet (0, 1) that accepts strings that do NOT have 111 as a substring. For example: 1011 and 000110 will be accepted but 011100 and 111101 will not.

Design strings {0,1} NFA such that it does not have 011 and 101.