Python qs

Information = [[James,Dancer,9000,9],

[Nina,Singer,4000,2],

[Samantha,Engineer,5000,5],

[Tom,Teacher,2000,3],

[Adam,Teacher,4000,5]]

The lst position in every sublist : Name

The 2nd position in every sublist : Occupation

The 3rd position in every sublist : expected salary

The 4th position in every sublist : years of experience

Design an algorithm that sort the information by Name alphabetically(A-Z), by expected salary (Low - High) and by the years of experience(High to Low).

You can sort one aspect at a time but your algorithm must support all 3 sorting aspects.

Please use mergesort as it has the lowest time complexity compared to other sorting algorithms.

Results of Sort by Expected Salary (Low to High):

[[Tom,Teacher,2000,3],

[Nina,Singer,4000,2],

[Adam,Teacher,4000,5],

[Samantha,Engineer,5000,5],

[James,Dancer,9000,9]]