Please code in C++ ### Lab OverviewIn this lab, you will simulate one of the classical synchronization problems to understand how the (semi) critical section problem can be implemented using binary and counting semaphores.### Process Description- **Processes Involved**: 3 readers and 2 writers.- **Reader Processes**: Up to two reader processes can be within their critical section simultaneously without any writer process present.- **Writer Processes**: Before entering its critical section, a writer process should check for the presence of any reader or writer process already in the critical section.### Critical Section BehaviorThe critical section involves:- **Reading** from a shared data buffer for reader processes.- **Updating** the shared data buffer for writer processes.Implementing real shared data for readers and writers is optional. However, your output must clearly demonstrate:- When any reader or writer process enters its critical section, it must report the presence of other readers or writers.- (Optional) You may print the data read or written if implementing a real buffer.- Implement a function to generate "Panic Messages" if the rules of this semi-critical section problem are not followed. A correct solution should not trigger these messages.### Main Program Execution- Utilize a random number generator to select processes for execution.- Each selected process performs one instruction before returning control to the main function.- The subsequent process is chosen by another random number generation. Ensure each process executes exactly one instruction before resuming, maintaining its state for future execution.### Implementation Guidelines- Implement using a `switch` statement in C or C++.- Avoid using multithreading or mutex lock features inherent to the programming language.- Each process (reader or writer) should be handled within a single big `switch` statement and returned after each instruction. Maintain a global program counter for each process to ensure accurate resumption.### Subprojects- **Subproject 1**: Implement this with **binary and counting semaphores**.- **Subproject 2**: Implement this with **testandset function**.

In, the above program given information is: 5 processes are characterized by 3 readers and 2 writers. Up to two reader processes can be inside their critical section without any writer process. For writer process to go into its critical section, it should check whether there is any reader or writer process is in the critical section. Critical section in this problem is reading shared data buffer for reader and updating shared data buffer for writer processesANSWER;- int main() { char str[100]; char splitStrings[10][10]; //can store 10 words of 10 characters int i,j,cnt; printf("Enter a string: "); gets(str); j=0; cnt=0; for(i=0;i<=(strlen(str));i++) { // if space or NULL found, assign NULL into splitStrings[cnt] if(str[i]==' '||str[i]=='\0') { splitStrings[cnt][j]='\0'; cnt++; //for next word j=0; //for next word, init index to 0 } else { splitStrings[cnt][j]=str[i]; j++; } } printf("\nOriginal String is: %s",str); printf("\nStrings (words) after split by space:\n"); for(i=0;i < cnt;i++) printf("%s\n",splitStrings[i]); return 0; }