Schedule Classification. Consider the schedule below for four parts numbered $1-4,$ each to be processed in $4$ machines, named A$-$D$.$ This schedule is $($select the best option$)$ and justify your answer:

$\backslash$table$[[$Machine A$,1,1,3,1,4,2,2,3,,,,,,,,],[$Machine B$,,,,,,,1,2,,,,,,,,4,3,,,3,3,,,,,,],[$Machine C$,,4,1,,,,,,,,,2,2,,,,,,1,4,,,2,4,4,,3,4,4],[$Machine D$,,,,2,1,,,,,,,3,2,,,1,3,,,,4,4,4,,,,,],[$Time$,1.,2,31,4,5,6,7,8,9,10,11,12,13,14,\backslash$table$[[15,16]],17,18,19,\backslash$table$[[20,2]],21,22\sqrt[\phantom{2}]{2},232,,25]]$

A$.$ Not Semi$-$active

B$.$ Semi$-$active, but not Active

C$.$ Active, but not Non$-$delay

D$.$ Non$-$delay