you k server number 0 k1 handle multiple request simultaneously each server infinite computational capacity handle request time the request assign server accord specific algorithmthe ith 0indexed request arrivesif server busy request drop handle allIf kth server available assign request serverotherwise assign request available server wrapping list server start 0 necessary for example ith server busy try assign request i1th server i2th server onyou give strictly increase array arrival positive integer arrivali represent arrival time ith request array load loadi represent load ith request time take complete your goal find busy server a server consider busiest handle number request successfully serversreturn list contain id 0indexe busy server you return id order Example 1Input k 3 arrival 12345 load 52333 Output 1 Explanation all server start availableThe 3 request handle 3 server orderrequ 3 come Server 0 busy assign available server 1request 4 come it handle server busy droppedserver 0 2 handle request server 1 handle request hence server 1 busy serverexample 2input k 3 arrival 1234 load 1212output 0explanation the 3 request handle 3 serversrequ 3 come it handle server 0 server availableserver 0 handle request server 1 2 handle request hence server 0 busy serverexample 3input k 3 arrival 123 load 101211output 012explanation each server handle single request consider busy Constraints1 k 1051 arrivallength loadlength 105arrivallength loadlength1 arrivali loadi 109arrival strictly increase