Consider a system using variable-partition scheme. given five memory partitions of 200kb, 500kb, 100kb, 600kb and 400kb in order, how would the first-fit, best-fit and worst-fit algorithm work with incoming processes of 221kb, 471kb, 127kb, and 451kb? input which partition the process is allocated to, and how many kbs left in that partition. if a process cannot be allocated, put “/” in both the blanks. consider a system using variable-partition scheme. given five memory partitions of 200kb, 500kb, 100kb, 600kb and 400kb in order, how would the first-fit, best-fit and worst-fit algorithm work with incoming processes of 221kb, 471kb, 127kb, and 451kb? input which partition the process is allocated to, and how many kbs left in that partition. if a process cannot be allocated, put “/” in both the blanks.