this code is stuck in a never ending loop where one child guesses $0$ and child two guesses one. the game number isnt displayed or incremented

Please fix the following code and run it in vscode on mac os using

gcc $-$o filename filename.c

please send the output of the terminal

please make sure it completes all ten games and handles the signals properly

PLEASE PLEASE do not send code that will not work. This is my fifth time asking the same question that other "experts" have not properly completed. COMPILE AND RUN, SEND instructions on how to fix the code

#include

#include

#include

#include

#include

#include

#include

$//$ Global variables for signal handling and game state

volatile sig$\_$atomic$\_$t child$1\_$ready $=0$;

volatile sig$\_$atomic$\_$t child$2\_$ready $=0$;

volatile sig$\_$atomic$\_$t child$1\_$guess $=0$;

volatile sig$\_$atomic$\_$t child$2\_$guess $=0$;

int child$1\_$score $=0,$ child$2\_$score $=0$;

int target $=0$;

$//$ Signal handlers for the referee $($parent$)$

void handle$\_$sigusr$1($int sig$)\{$

child$1\_$ready $=1$;

child$1\_$guess $=1$;

$\backslash$ddots

void handle$\_$sigusr$2($int sig$)\{$

child$2\_$ready $=1$;

child$2\_$guess $=1$;

$\}$

void handle$\_$sigint$($int sig$)\{$

printf$("$Game interrupted. Final scores:

$")$;

printf$("$Player $1$: $\%$d$,$ Player $2$: $\%$d

$",$ child$1\_$score, child$2\_$score$)$;

exit$(0)$;

$\}$

$//$ Referee's game logic

void referee$\_$game$($int child$1\_$pid, int child$2\_$pid$)\{$

for $($int game$\_$round $=1$; game$\_$round $<=10$; game$\_$round$++)\{$

$//$ Generate target number

target $=$ rand$()\%100+1$;

printf$("$Game $\%$d: Target is $\%$d

$",$ game$\_$round, target$)$;

$//$ Notify children to start guessing

kill$($child$1\_$pid, SIGUSR$1)$;

kill$($child$2\_$pid, SIGUSR$2)$;

while $(1)\{$

if $($child$1\_$ready && child$2\_$ready$)\{$

$//$ Read guesses from files

int guess$1,$ guess$2$;

int fd$1=$ open$("$guess$1.$txt$",0\_$RDONLY$)$;

int fd$2=$ open$("$guess$2.$txt$",0\_$RDONLY$)$;

read$($fd$1,$ &guess$1,$ sizeof$($int$))$;

read$($fd$2,$ &guess$2,$ sizeof$($int$))$;

close$($fd$1)$;

close$($fd$2)$;

printf$("$Player $1$ guessed: $\%$d$,$ Player $2$ guessed: $\%$d

$",$ guess$1,$ guess$2)$;

$//$ Compare guesses with the target

if $($guess$1==$ target$)\{$

child$1\_$score$++$;

printf$("$Player $1$ wins this round!

$")$;

break;

$\}$ else if $($guess$1<$ target$)\{$

$|$ kill$($child$1\_$pid, SIGUSR$1)$; $//$ Guess was too low

$\}$ else $\{$

$|$ kill$($child$1\_$pid, SIGUSR$2)$; $//$ Guess was too high

$\}$

if $($guess$2==$ target$)\{$

$|$hild$2\_$score$++$;

printf$("$Player $2$ wins this round!

$")$;

break;

$\}$ else if $($guess$2<$ target$)\{$

$|$ kill$($child$2\_$pid, SIGUSR$1)$; $//$ Guess was too low

$\}$ else $\{$

$|$ kill$($child$2\_$pid, SIGUSR$2)$; $//$ Guess was too high

$\}$

$//$ Reset flags for the next round

child$1\_$ready $=0$;

child$2\_$ready $=0$;

$\}$

$//$ Reset the game by sending SIGINT to children

kill$($child$1\_$pid, SIGINT$)$;

kill$($child$2\_$pid, SIGINT$)$;

printf$("$Final scores:

Plaver $1$: $\%$d$,$ Plaver $2$: $\%$d

$",$ child$1$ score, child$2$ score$)$;

$```$

$\}$

$//$ Player $1\text{'}$s guessing strategy $($binary search$)$

void player$1\_$logic$()\{$

int min $=0,$ max $=100,$ guess;

while $(1)\{$

guess $=($min $+$ max$)/2$; $//$ Binary search strategy

int fd $=$ open$("$guess$1.$txt$",0\_$WRONLY $|0\_$CREAT $|0\_$TRUNC, $0644)$;

write$($fd$,$ &guess, sizeof$($int$))$;

close$($fd$)$;

kill$($getppid$(),$ SIGUSR$1)$; $//$ Signal parent that guess is ready

pause$()$; $//$ Wait for parent's response

if $($child$1\_$guess$)\{$

if $($guess $<$ target$)$ min $=$ guess;

if $($guess $>$ target$)$ max $=$ guess;

$\}$

$\}$

$\}$

$//$ Player $2\text{'}$s guessing strategy $($random guessing$)$

void player$2\_$logic$()\{$

int min $=0,$ max $=100,$ guess;

srand$($time$($NULL$))$;

while $(1)\{$

guess $=($rand$()\%($max $-$ min $+1))+$ min; $//$ Random guess strategy

int fd $=$ open$("$guess$2.$txt$",0\_$WRONLY $|0\_$CREAT $|0\_$TRUNC, $0644)$;

write$($fd$,$ &guess, sizeof$($int$))$;

close$($fd$)$;

kill$($getppid$(),$ SIGUSR$2)$; $//$ Signal parent that guess is ready

pause$()$; $//$ Wait for parent's response

if $($child$2\_$guess$)\{$

if $($guess $<$ target$)$ min $=$ guess;

if $($guess $>$ target$)$ max $=$ guess;

$\}$

$\}$

$\}$

$//$ Main function that sets up signal handlers, forks children, and starts the game

int main$()\{$

$``````$

srand$($time$($NULL$))$; $//$ Seed random number generator

$//$ Set up signal handlers

struct sigaction sa;

sa$.$sa$\_$flags $=0$;

sa$.$sa$\_$handler $=$ handle$\_$sigusr$1$;

sigaction$($SIGUSR$1,$ &sa$,$ NULL$)$;

sa$.$sa$\_$handler $=$ handle$\_$sigusr$2$;

sigaction$($SIGUSR$2,$ &sa$,$ NULL$)$;

sa$.$sa$\_$handler $=$ handle$\_$sigint;

sigaction$($SIGINT$,$ &sa$,$ NULL$)$;

pid$\_$t child$1\_$pid $=$ fork$()$;

if $($child$1\_$pid $==0)\{$

$|$ player$1\_$logic$()$; $//$ Player $1$ code

$\}$

pid$\_$t child$2\_$pid $=$ fork$()$;

if $($child$2\_$pid $==0)\{$

$|$ player$2\_$logic$()$; $//$ Player $2$ code

$\}$

referee$\_$game$($child$1\_$pid, child$2\_$pid$)$; $//$ Parent code

$//$ Clean up

kill$($child$1\_$pid, SIGTERM$)$;

kill$($child$2\_$pid, SIGTERM$)$;

wait$($NULL$)$; $//$ Reap child processes

wait$($NULL$)$;

return $0$;

$\}$

while $(1)\{$

if $($child$1\_$ready && child$2\_$ready$)\{$

$//$ Read guesses from files

int guess$1,$ guess$2$;

int fd$1=$ open$("$guess$1.$txt$",0\_$RDONLY$)$;

int fd$2=$ open$("$guess$2.$txt$",0\_$RDONLY$)$;

read$($fd$1,$ &guess$1,$ sizeof$($int$))$;

read$($fd$2,$ &guess$2,$ sizeof$($int$))$;

close$($fd$1)$;

close$($fd$2)$;

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!

Q:

The primary class in the program encapsulates the notion of a Game. A game in turn contains several components, including (1) a GameWorld which holds a collection of game objects and other state...

Q:

Assignment #1: Class Associations & Interfaces Due Date: Monday, February 22nd at 11:59 PM (2 weeks) Introduction This semester we will study object-oriented graphics programming and design by...

Q:

Program Structure Because you will be working on the same project all semester, it is extremely important to organize it correctly from the beginning. Pay careful attention to the class structure...

Q:

I can't add words into my Set when constructing, I was wondering what's the right code for it? Thank you handout #7 CSE143Computer Programming II Programming Assignment #4 due: Thursday, 2/2/23, 11...

Q:

see below questions and provide me adjusted coding by using my coding. I share my coding and test failure message at the end. 1. BST.java 2.BSTNode.java Binary Search Tree you will be coding the...

Q:

Please help me on this assignment! It's Java! Create a new class called Lab18GOM that is extended from JFrame. Make sure you store it in a file called Lab18GOM.java Enter your personal information at...

Q:

Tallahassee bean counters case solution and all the 5 questions beginning of the case. Also describe about equipment purchased fraud and how it was committed? NOTICE Do not make Teaching Notes...

Q:

Hi, Can someone help me with this project which I'm now working on. There are 8 steps I've already finished the first 2 of them, while I stuck by the 3rd one. Here're the requirements, this is just a...

Q:

CSE 231 Project 02. In need of help, Code for this project would be much appreciated. The last picture is what I have so far but do not know where to go from there. Needs do be done on Python please...

Q:

So i designed a blackjack card game in java using javafx. Below is the code for it: Hand.java class: import Card.Rank; import javafx.beans.property.SimpleIntegerProperty; import...

Q:

1. Tesla uses lease accounting for automotive sales under its resale value guarantee program. Assume that instead of using lease accounting for automotive sales under its resale value guarantee...

Q:

Prior to the financial crisis in 2008, you could buy a CDS on a security without actually owning that security. Why is that a problem?

Q:

Which of the following statements regarding data management risk are not true Group of answer choices Institutions that invest in data infrastructure and data management increase their chance of...

Q:

Multiple Choice Question The Blank______ curve for positive externalities reflects the benefit to the individuals who pay for the product. Multiple choice question. market supply market demand...

Previous Question Next Question