Implement the pseudo code in java and C$++$ program, explain how the semaphores works in the program

Pseudocode:

class Teams:

team$\_$name

team$\_$members

score $($shared variable$)$

binary$\_$semaphore

def submit$\_$solution$($team$\_$name, solution$\_$file, score$)$:

$//$Critical Section

wait$($binary$\_$semaphore$)//$ Ensure only one team member submits at a time

send$\_$file$\_$to$\_$submission$\_$station$($solution$\_$file$)$

signal$($binary$\_$semaphore$)$

class SubmissionStation:

solution$\_$files

counting$\_$semaphore $($initialized to the maximum number of concurrent submissions$)$

def receive$\_$solution$($solution$\_$file$)$:

$//$Critical Section

wait$($counting$\_$semaphore$)//$ Limit concurrent submissions

store$\_$solution$($solution$\_$file$)$

signal$($counting$\_$semaphore$)$

def provide$\_$solutions$\_$to$\_$judges$()$:

for solution$\_$file in solution$\_$files:

send$\_$file$\_$to$\_$judge$($solution$\_$file$)$

class Judges:

counting$\_$semaphore $($initialized to the number of judges$)$

def evaluate$\_$solution$($solution$\_$file$)$:

$//$Critical Section

wait$($counting$\_$semaphore$)//$ Limit concurrent evaluations

if solution$\_$correct$($solution$\_$file$)$:

scorekeeper.update$\_$score$($solution$\_$file.team$\_$name$)$

signal$($counting$\_$semaphore$)$

class Scorekeeper:

team$\_$scores

counting$\_$semaphore $($initialized to the maximum number of concurrent updates$)$

def update$\_$score$($team$\_$name, points$)$:

$//$Critical Section

wait$($counting$\_$semaphore$)//$ Protect score updates

team$\_$scores$[$team$\_$name$]+=$ points

signal$($counting$\_$semaphore$)$

def get$\_$score$($team$\_$name$)$:

return team$\_$scores$[$team$\_$name$]$