A programer at Global Office Location Development (GOLD) is assigned to compare the empirical performance of several algorithms to "take over the world" (TOTW), each employing a different classic algorithm-design technique: - totw_brute force(cities) - totw_exhaustive_search(cities) - totw_transform_and_conquer(cities) - totw_decrease_and_conquer(cities) - totw_divide_and_conquer(cities) [a] Briefly describe each of the five aforementioned algorithm-design techniques [b] Define a function to obtain a random list of size unique cities from a master list called all_cities. [c] Define a function to systematically run and time each of the five algorithms for random lists of 100,200,,1000 cities and tabulate the results in a 2-D list (algorithm vs. size). Don't worry about actually printing/formatting/plotting the list. (Note: for these questions, it is not necessary to know the inner workings of any of the five functions listed.)