please help me translate this peasdocode into working java code, its answering the question in the attached photo

class Process:

def $\_\_$init$\_\_($self$,$ id$,$ service$\_$time, arrival$\_$time$)$:

self.id $=$ id

self.service$\_$time $=$ service$\_$time

self.remaining$\_$time $=$ service$\_$time

self.arrival$\_$time $=$ arrival$\_$time

self.start$\_$time $=$ None

self.end$\_$time $=$ None

self.initial$\_$wait$\_$time $=$ None

self.total$\_$wait$\_$time $=0$

def round$\_$robin$\_$scheduling$($processes$,$ quantum, context$\_$switch$)$:

time $=0$

process$\_$queue $=[]$

completed$\_$processes $=[]$

while True:

# Load arriving processes into the queue

for process in processes:

if process.arrival$\_$time $==$ time:

process$\_$queue.append$($process$)$

if not process$\_$queue and all$($p$.$remaining$\_$time $==0$ for p in processes$)$:

break # All processes are completed

if process$\_$queue:

current$\_$process $=$ process$\_$queue.pop$(0)$

if current$\_$process.start$\_$time is None:

current$\_$process.start$\_$time $=$ time

if current$\_$process.initial$\_$wait$\_$time is None:

current$\_$process.initial$\_$wait$\_$time $=$ time $-$ current$\_$process.arrival$\_$time

execution$\_$time $=$ min$($current$\_$process.remaining$\_$time, quantum$)$

current$\_$process.remaining$\_$time $-=$ execution$\_$time

time $+=$ execution$\_$time

if current$\_$process.remaining$\_$time $>0$:

process$\_$queue.append$($current$\_$process$)$

else:

current$\_$process.end$\_$time $=$ time

completed$\_$processes.append$($current$\_$process$)$

# Add context switch time if there are more processes in the queue

if process$\_$queue:

time $+=$ context$\_$switch

for process in process$\_$queue:

process.total$\_$wait$\_$time $+=$ execution$\_$time $+($context$\_$switch if process$\_$queue.index$($process$)!=0$ else $0)$

else:

time $+=1$ # Increment time if no process is in the queue

# Calculate total wait time and turnaround time

for process in completed$\_$processes:

process.total$\_$wait$\_$time $+=$ process.initial$\_$wait$\_$time

process.turnaround$\_$time $=$ process.end$\_$time $-$ process.arrival$\_$time

# Output results

print$("$Process ID $|$ Start Time $|$ Initial Wait Time $|$ End Time $|$ Total Wait Time $|$ Turnaround Time"$)$

for process in completed$\_$processes:

print$($f$"\{$process$.$id$\}|\{$process$.$start$\_$time$\}|\{$process$.$initial$\_$wait$\_$time$\}|\{$process$.$end$\_$time$\}|\{$process$.$total$\_$wait$\_$time$\}|\{$process$.$turnaround$\_$time$\}")$

# Define processes based on the given table

processes $=[$

Process$(1,75,0),$

Process$(2,40,10),$

Process$(3,25,10),$

Process$(4,20,80),$

Process$(5,45,85)$

$]$

# Case $1$: Quantum $=10,$ Context Switch $=0$

print$("$Case $1$: Quantum $=10,$ Context Switch $=0")$

round$\_$robin$\_$scheduling$($processes$,10,0)$

# Reset processes for Case $2$

processes $=[$

Process$(1,75,0),$

Process$(2,40,10),$

Process$(3,25,10),$

Process$(4,20,80),$

Process$(5,45,85)$

$]$

# Case $2$: Quantum $=10,$ Context Switch $=2$

print$("$

Case $2$: Quantum $=10,$ Context Switch $=2")$

round$\_$robin$\_$scheduling$($processes$,10,2)$Case $1$: Quantum $=10,$ context switch $=0$

Case $2$: Quantum $=10,$ context switch $=2$