Does the Earliest Deadline First algorithm minimize this L$($A$)?$

In your answer, discuss the swapping of the inversions with this L$($A$).$

Either prove that the Earliest Deadline First algorithm minimizes also

this L$($A$)$ or give a numerical counter example