Please see the below questions and answer them

Option 1:  • Programming with Python, Java, or C/C++ .  - Implement Depth First Search (Traversal)  - Implement Breadth First Traversal  Note :  For your implementation,  1. Create a directed graph with 10 Vertices  2. Add arbitrary edges among vertices to satisfy the directed graph  3. Run your program and show appropriate output (Traversal order)  4. Your implementation should be fully commented  For your submission,  Please, submit your source code and output (Screen Capture) in a word file.  

Option 2:  •Research and summarize on algorithms (Dijkstra's algorithm, Ford’s algorithm)  for finding shortest paths between nodes in a graph.