Updated .md to describe the generalized problem

Author: udistructor

algorithms/7_SelectionSort/selection_sort_exercise.md

@@ -1,10 +1,15 @@
 # Exercise: Selection Sort
 
-Implement a Milti-Level Sort of a given list of dictionaries. A single dictionary entry contains two keys 'First Name' and 'Last Name'. the list should be sorted first based on 'First Name', then based on 'Last Name', w.r.t. common/same 'First Name' entries.
+Implement a Multi-Level Sort of a given list of dictionaries based on a given sorting order. If user wants to sort dictionary based on First Key 'A', Then Key 'B', they shall pass list of keys in the order of  preference as a list ['A','B']. Your code should be able to sort list of dictionaries for any number of keys in sorting order list.
 
+Using this multi-level sort, you should be able to sort any list of dictionaries based on sorting order preference
 
+Example:
+A single dictionary entry contains two keys 'First Name' and 'Last Name'. the list should be sorted first based on 'First Name', then based on 'Last Name', w.r.t. common/same 'First Name' entries.
 
-For example, given the sequence List:
+for this, one shall past sorting order of preference list [ 'First Name' , 'Last Name' ]
+
+For this, Given the following sequence List:
 
 ```
 [