Extended Pseudocode for Lawlers Algorithm

( USE JAVA NETBEANS)

I want java solution for tihs question

1. for i = 1 to n do n(i) = ; //find number of unscheduled, direct successors for job i 2. US = {1,,n}; p = ; //initial p is the completion time of the last job 3. for k = n to 1 do BEGIN 4. Find job with n(j) = 0 and minimal fj(p)-value; 5. US = US \ {j}; //j is scheduled 6. n(j) = ; 7. (k) = j; //kth position is occupied by job j 8. p = p pj ; 9. for i = 1 to n do if aij = 1 then n(i) = n(i) 1; END