2. Traversing an unweighted graph using DFS or BFS traversal on the same staring vertex s, results in a spanning tree T distinguished by discovery edges. Which algorithm provides the shortest path (minimum umber of edges) between any two arbitrary vertices in the connected component of s? Explain why.

What causes algorithms to produce biased results? A) the dataset contains no data B) the programming language are wrong C) the dataset is skewed in one direction D) the programmer are inexperienced