Please explain why

2. (1.5 Mark) What do you expect to observe in terms of the running time of the algorithms that use a heuristic function in comparison to the algorithms that do not use a heuristic function? Select one of the following options and justify your answer. Hint: You should consider the differences in terms of computational cost of generating a set of children and adding them to the OPEN list for uninformed and informed algorithms. a) The running time will increase exactly in the same proportion in which the number of expansions increases. For example, if A* expands 27% more states than Dijkstra's algorithm, then A* will be exactly 27% slower than Dijkstra's algorithm. b) The running time will decrease exactly in the same proportion in which the number of expansions decreases. For example, if A* expands 27% fewer states than Dijkstra's algorithm, then A* will be exactly 27% faster than Dijkstra's algorithm. c) The running time will increase, but not as much as the number of expansions increases. For example, if A* expands 27% more states than Dijkstra's algorithm, then A* will be a bit less than 27% slower than Dijkstra's algorithm. d) The running time will decrease, but not as much as the number of expansions decreases. For example, if A* expands 27% fewer states than Dijkstra's algorithm, then A* will be a bit less than 27% faster than Dijkstra's algorithm