A Job Shop Scheduling Problem Seven jobs (1, 2, 3, 4, 5, 6, 7) need to be processed today in a machine shop that has 4 machines (A, B, C, D). A machine can process multiple jobs. The following table provides the processing time (hours) and processing cost ($) on each machine, as well as the number of hours each machine is available today. For example, job 3 requires 5 hours processing time on machine C which costs $130; the available time on machine C today is 10 hours. A \"-\" for the (i,j) element means that machine i cannot process job j. Find the assignments of jobs to machines so that all jobs are processed today at minimum total cost given the availability of the machines. Solve using Lingo's modeling language. Processing times d (hours) and costs c (5) Available Hint: Assign a very high value to processing time and cost if a machine cannot process a job (e.g. 1000). Use @BIN lingo function for all binary variables