Construct DFA The set of binary strings that start with 01 and end with 10. Σ = (0,1)

#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

(4) {w € [0, 1]* : w does not have 001 as a substring} Testing strings: €, 0, 1, 01, 000, 001, 0001, 0010, 0101, 11000, 110010 The accepted strings are: L U E O 01 000 001 0001 ☐ 0010 0101 11000 110010

Ice Cubes Jojo is playing with ice cubes. He puts some ice cube sized 2×2×2 on a table. He wanted to make N stacks adjecent to each other stacks withXi cubes for the ith stack. Jojo is curious how much is the perimeter and area of the stacks given Jojo is looking at the stacks from the front in 2-dimentional form. Help Jojo calculate the perimeter and the area. Format InputThe input will consist of several lines of input in ”testdata.in” file. First consists of T, the number of test cases. For each testcase consists of integer N, the number of stacks. The next line consists of the N integer, the number Xi for the ith stack. Format OutputOutput should be expressed in format ”Case #X: Y1 Y2” - X is the number of the test case, and followed by Y1 and Y2 - The perimeter and the area of the test case. Constraints • 1 ≤ T ≤ 100 • 1 ≤ N ≤ 100 • 1 ≤ Xi ≤ 100 Sample Input (testdata.in) 1 3 2 1 3 Sample Output (standard output) Case #1: 28 24 Hello Sir. Can you explain the code in C language…