G: Show how to sort n integers in the range [0; (n5 1)] in O(n) time and at most O(n) space. Write down the pseudocode and justify why your algorithm correctly sorts any array of n integers in the above range and why it runs in O(n) time. Hint: Read CLRS section 8.3 and understand how Radix sort works.

i think is g(1)=-1.

hope that i can

this answer is !

for this case we must apply distributive property to the following expression:

the distributive property states that:

then, when applying the property we have to multiply the -2 for each term within the parenthesis:

127

whether it's diameter, or radius, i believe if i remember correctly from school, every amount has to always add up to 180. so if you take 53, and starting adding, long story short, taking 127 and adding it to 53, gives you 180.