3. Before inserting a large list of words that is almost sorted (most part is sorted but small portion is not sorted) into a MWT, do you prefer to first shuffle the words, sort the words, or neither? What about TST? Briefly explain the reason in each case. (1 point) 4. List the order of marking vertices as "visited using DFS and BFS from "O" on the following undirected graph. When there are multiple vertices to explore, we assume DFS and BFS will first enqueue or push the vertex with smaller index onto the queue or stack, respectively. Note that DFS and BFS will only explore unvisited vertex. (1 point) DFS 000 BFS