can someone please help me with this?

Part Il: Proof Show that the following language is NP-complete. Given two identical machines and a collection of n jobs JiJ2... J that a machine can complete in times equal to maxTime seconds. (You may assume that the times are all whole numbers of seconds.) ti,t2,..tn seconds, respectively, and a maximum time maxTime, say that the jobs are finishable in MaxTime if one can partition the jobs into two disjoint sets that the machine can finish in less than or Thus, just concentrating on the times, we can say T = , ,tnJis finishable in maxTime if and only if T = {ti,t2, ,t.) can be partitioned into two subsets U = {ui,U2, ,Up)and V-M,V2 ,VJ such that Let L = {