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.
You'll need a helper variable for this, so depending on your programming language, the solution becomes:
int helper;
helper = arr[i];
arr[i] = arr[j];
arr[j] = helper;
Answer:
The Firewall (Router) is the vulnerable hardware.
Explanation:
The entry into the network will be the firewall (If there is a firewall installed on the network), if this medium is compromised, every workstation on the network will be vulnerable.
