Consider the directed graph shown below: Q1. Using BFS with the above graph, when BFS finishes execution and if searching for a path between S and G, what will be the number of extended nodes (NXN), Number-of-Enqueued Nodes (NEN), Cost of the path? a) NXN=10, NEN=10,Cost=18 b) NXN=9, NEN =18, Cost =17 c) NXN=10, NEN =11, Cost =18 d) NXN=12, NEN=18, Cost =20 e) NXN=10, NEN=17, Cost =18 Q2. Using DFS with the above graph, when DFS finishes execution and if searching for a path between S and G, what will be the number of extended nodes (NXN), Number-of-Enqueued Nodes (NEN), Cost of the path? a) NXN=10, b) NXN=9, c) NXN=8, d) NXN=4, \begin{tabular}{ll} NEN =10, & Cost =4 \\ NEN =8, & Cost =17 \\ NEN =11, & Cost =18 \\ NEN =8, & Cost =32 \\ NEN =17, & Cost =32 \end{tabular} e) NXN=4, Q3. Using UCS with the above graph, what will be the content of the priority queue at the 8th step when we use UCS with the above graph and search for a path from S to G ? a) [('SCH', 7.0), ('SAE', 8.0), ('SBE', 8.0), ('SAD', 9.0), ('SBFI', 19.0)] b) [('SBE', 8.0), ('SAD', 9.0), ('SAEG', 18.0), ('SAEI', 19.0), ('SBFI', 19.0), ('SCHG', 21.0)] c) [('SAE', 8.0), ('SBE', 8.0), ('SBF', 7.0), ('SCH', 7.0), ('SADH', 18.0)] d) [('SAE', 8.0), ('SBE', 8.0), ('SAD', 9.0), ('SBFI', 19.0), ('SCHG', 21.0)] e) None of the above