Discuss ways in which the priority inversion problem could be addressed in a real$-$time system. Also discuss whether the solutions could be implemented within the context of a proportional share scheduler.

#define MAX$\_$PROCESSES $255$

int number$\_$of$\_$processes $=0$;

$/*$ the implementation of fork$()$ calls this function $*/$

int allocate$\_$process$()\{$

int new$\_$pid;

if $($number$\_$of$\_$processes $==$ MAX$\_$PROCESSES$)$

return $-1$;

else $\{$

$/*$ allocate necessary process resources $*/$

$++$number$\_$of$\_$processes;

return new$\_$pid;

$\}$

$\}$

$/*$ the implementation of exit$()$ calls this function $*/$

void release$\_$process$()\{$

$/*$ release process resources $*/$

$--$number$\_$of$\_$processes;

$\}$

released. Illustrate how semaphores can be used by a server to limit the number of concurrent connections.