I need to find the most cost-efficient solution for the following problem. The network diagram is provided for your reference only. Please explain step by step so I can learn. Thank you!

People Successor Duration Minimum Cost People Assigned Trim Cost Activity Activities (days) Duration ($000) Assigned if Crash ($000) A B,E 5 1 G 0.5 D 0.5 1 1 AAUW AUTOINA 0.75 - - N UZFX3DInC WANA NOW AUA AUDIA WA WOW N N A WA AA WNWWNN N A N W WW W AA D WW WANG ( X Z3FXInMOOD 0.75 WOWUI NW AAU A AO - NN - WOW AWARD NONE Zza 0.75 2 B =2 G =5 12 13 A =4 R=5 N = 4 E =4 S = 3 18 F = 3 C =5 P = 3 H =4 M=3 10 D = 5 J=4 K -4 L = 4