Write a function sort$\_$demand$\_$supply$($status$)$ that takes a dictionary of demands and supplies and returns the information as a list of tuples sorted by the value so that locations with greatest demands $($the most negative number$)$ are provided first.

Input:

status: a dictionary of demands and supplies. The keys are the location labels $($strings$)$ and the values are integers, where a positive value represents supply and a negative value represents demand.

Your function should return a list of tuples, where each tuple is of the form $($location$,$ demand$\_$supply$),$ and the list should be sorted in ascending order by their demand$\_$supply $($i$.$e$.$ greatest demand to greatest supply$).$ If two or more locations have the same demand or supply, tie$-$break by alphanumeric order on their labels.

You may assume:

Inputs are correctly formatted data structures and types

$sor{t}_{d}eman{d}_s$upply$(status)$

$[{(}^{\text{'}}L{4}^{\text{'}},-40),{(}^{\text{'}}L{7}^{\text{'}},-30),{(}^{\text{'}}L{2}^{\text{'}},-5),{(}^{\text{'}}{3}^{\text{'}},5),{(}^{\text{'}}L{5}^{\text{'}},5),{(}^{\text{'}}L{6}^{\text{'}},10),{(}^{\text{'}}L{8}^{\text{'}},10),{(}^{\text{'}}L{1}^{\text{'}},50)]$

Another example:

$sor{t}_{d}eman{d}_s$upply$(status)$

$[{(}^{\text{'}}L{5}^{\text{'}},-60),{(}^{\text{'}}L{3}^{\text{'}},-50),{(}^{\text{'}}L{2}^{\text{'}},-20),{(}^{\text{'}}L{1}^{\text{'}},30),{(}^{\text{'}}L{4}^{\text{'}},100)]$