The following code demonstrates a pair of parent process and child process. Select all the possible outputs. void fork$\_$wait$()\{$ int child$\_$status; if $($fork$()==0)\{$ printf$("$HC

$")$; exit$(0)$; $\}$ else $\{$ printf$("$HP

$")$; wait$($&child$\_$status$)$; printf$("$CT

$")$; $3$ printf$("$Bye

$")$; $\}$ HP HC Bye $$ HC Bye HP $$ HC Bye $2$ HP $$ Bye HP $$ Bye HC $$ HC Bye $$ Select all the correct statement about IPC. Messages in a message queue can only be read in a FIFO manner. FIFO is a unidirectional communication method between processes. Poperation will reduce the count of semaphore by $1.$ Pipe can be accessed by any process. V operation will increase the count of semaphore by $1.$ Shared memory is the most efficient inter$-$process communication method.