I need pseudocode of this thanx for your code !

Extended Pseudocode for Lawler's Algorithm 1, for i = 1 to n do n(i)-y=1aij://find number of unscheduled, direct successors for job i 2. US= {1, ,n}; p-y=1PJ://initial p is the completion time of the last job 3, for k = n to 1 do BEGIN 4. Find job jeUS with n(j) 0 and minimal f,(p)-value; US = USVi}://j is scheduled 7. 8. 9, (k-j; //kth position is occupied by job j p=p-pi; for i = 1 to n do if aij = 1 then n(i) = n(i)-1; END