(Solved): In C++ please(: Implement a multi-process linear search. The parent process shall load a file of str ...

Implement a multi-process linear search. The parent process shall load a file of strings into an array (or a vector), split the array into $n$ sections, and then fork off $n$ children. Each child process shall search one of the $n$ sections of the array, for the specified string. If the child does not find the string, it terminates with the exit code of 1 . Otherwise, it terminates with the exit code of 0. The parent, meanwhile, continuously executes wait(). Whenever, one of the child processes terminates, the wait() will unblock, and the parent process shall check the exit code of the child. The exit status of the child can be checked using the WEXITSTATUS macro as follows: //The variable to hold the exit status int exitstatus; //Other code... if(wait(\&exit status) < 1) \{ perror("wait"); exit(-1); $\}$ if(WEXITSTATUS(exit status) $==0$ ) $\{\dots \}\dots$ If all children terminate with the code of 1 , then the parent prints "No string found" to the terminal. Otherwise, the parent terminates all child processes and exits. A child process can be terminated using the kill() system call. For example, kill(1234,SIGKILL) will terminate and \#tinclude ; otherwise your program may not compile). Technical Details The program shall be ran using the following command line: ./multi-search $⟨$