Java application that will, given an appropriate data structure, will be able to track the following module and its dependencies as well as implement an appropriate search algorithm to create the correct graph for any given module. The graph will show all the corresponding dependent modules in their correct order of dependency.

Must use Stack, either Double ArrayList or Linked List, and simple search to implement this.

Module A: Dependencies: B D E K L

Module B: Dependencies: F G M

Module C: Dependencies: F

Module D: Dependencies: G

Module E: Dependencies: B A

Module F: Dependencies: B

Module G: Dependencies: NONE

Module K: Dependencies: M

Module L: Dependencies: Q

Module M: Dependencies: A

Module Q: Dependencies: NONE

Ensure that dependencies are only visited only once.

To test:

Input A

Your Output: Module A. Dependencies: B F G M D E K M L Q