In the table below, a general complex flow problem where 3 jobs are processed on 3 machines is given. Calculate the maximum completion time and the percentage of use of each machine by producing a lag-free schedule for this problem. (When it is time to start equal, priority will be given to Job 1 between Jobs and SPT between Actions)

operation (machine, operation time) work 1 2 (C,12) (0,5) (C,4) (A,4) (C, 11) (D,1) 3 (B,3) (A,3) (A,7) 2 3 operation (machine, operation time) work 1 2 (C,12) (0,5) (C,4) (A,4) (C, 11) (D,1) 3 (B,3) (A,3) (A,7) 2 3