Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Solution:
The flagging of an uncommon last name as a spelling error can be stopped by opening the shortcut menu on the first occurrence of the name and selecting of ignoring all.
Thus the required right answer is B.
Answer:
TOPIC
Explanation:
because if you dont have topic you cant create a presentation or a project that you will pass to your class,and if you have a topic present it neatly because you presentation or your project will be graded.
