Produce a flawless table or diagram if required. Resolve this issue immediately. Strict warning: No AI assistance.

BR$16$

"The following is implemented using $$GETS ALL$$ algorithm which identify $(1)$ the largest server type and $(2)$ schedule all jobs to the first one of largest server type.

Detailed with the use of GETS to identify the largest server type

$1$: Create a socket

$2$: Initialize input and output streams associated with the socket

$3$: Connect ds$-$server

$4$: Send HELO

$5$: Receive OK

$6$: Send AUTH username

$7$: Receive OK

$8$: While the last message from ds$-$server is not NONE do $//$ jobs $1-$ n

$9$: Send REDY

$10$: Receive a message $//$ typically one of the following: JOBN, JCPL and NONE

$//$Identify the largest server type; you may do this only once

$11$: Send a GETS message, e$.$g$.,$ GETS All

$12$: Receive DATA nRecs recSize $//$ e$.$g$.,$ DATA $5124$

$13$: Send OK

$14$: For i $=0$; i $<$ nRecs; $++$i do

$15$: Receive each record

$16$: Keep track of the largest server type and the number of servers of that type

$17$: End For

$18$: Send OK

$19$: Receive $.$

$20$: If the message received at Step $10$ is JOBN then

$21$: Schedule a job $//$ SCHD

$22$: End If

$23$: End While

$24$: Send QUIT

$25$: Receive QUIT

$26$: Close the socket

Your task is to implement a new scheduling algorithm, called First Capable. The algorithm can be implemented using $$GETS Capable$.$ It schedules a job to the first server in the response to GETS Capable regardless of how many running and waiting jobs there are. Code the new algorithm in Java Socket programming"