Implement a function that determines if there is a path between two nodes in a directed graph. The graph will be represented as an adjacency list, and the function should return a boolean value indicating the presence of a path.

Input: graph = {
  'A': ['B', 'C'],
  'B': ['D', 'E'],
  'C': ['F'],
  'D': [],
  'E': ['F'],
  'F': []
}, start = 'A', end = 'F'
Output: true
Explanation: There are multiple paths from node 'A' to node 'F', such as A -> B -> E -> F.

Requirements:

• The function signature should be bool hasPath(HashMap> graph, String start, String end).
• Discuss how you would implement this function and the choice of search algorithm.

Follow-up Discussion:

• What are the time and space complexities of your solution?
• How would your solution change if the graph were undirected?