In a two$-$resource sequencing problem,

a$.$ a job can be processed by either of its resources in any sequence.

b$.$ the processing time for each job on each resource is unknown.

c$.$ the goal is to minimize makespan.

d$.$ flow time is maximized.