Write a function shuffle$\_$dict$($somedict$)$ that behaves as follows. Its argument somedict is a dictionary. This function returns a new dictionary constructed as follows:

Let sorted$\_$keys be the sorted list of the keys of somedict.

Let sorted$\_$vals be the sorted list of the values that these keys are mapped to in somedict.

Construct a dictionary shuffled$\_$dict that maps sorted$\_$keys$[0]$ to sorted$\_$vals$[0],$ sorted$\_$keys$[1]$ to sorted$\_$vals$[1],$ sorted$\_$keys$[2]$ to sorted$\_$vals$[2],...$ sorted$\_$keys$[$n$]$ to sorted$\_$vals$[$n$].$

Return the dictionary shuffled$\_$dict so constructed.

Note: You can get the set of values in a dictionary somedict using somedict.values$().$ This is analogous to the keys$()$ method that gives the keys in a dictionary. In each case, you then need to use list$()$ to obtain a list.