Suppose that a multiprogrammed system has a load of N processes with individual execution times of t$1,$ t$2,...,$tN$.$ Answer the following questions:

a$.$ How would it be possible that the time to complete the N processes could be as small as: maximum $($t$1,$ t$2,...,$tN$)?$