An example of a networking problem that uses a greedy algorithm is when scheduling jobs for many job processors $($or people$).$ What variation of this greedy algorithm is available?

Schedule the jobs in alphabetical order.

Schedule jobs that take the longest time to run first.

Schedule the jobs via a random scheduler.

Schedule the jobs ordered by number of inputs for each job $($the more inputs, the nearer to the top of the schedule$).$