Assume that the information in part 1 are stored in a graph consisting of vertices and edges. Each vertex contains the information about each person. Each edge shows a directed friendship between the two vertices that it connects. This situation is illustrated by the figure below. Murry Sue Mary Piend Alce Zach Bil Jen Bob Fred By choosing one of the classical graph search algorithm from part 1, discuss in detail how would you use such algorithm to answer the questions: 1. who are Bob's friends? 2. who are Alice's friends-of-friends 3. who are Bob's friends-of-friends-of-friends