Question 9 Not yet answered Marked outof 1.00 - Rap question The following graph has 6 nodes with the edges and costs indicated below: 1 C After running Dijkstra's algorithm, choose the correct minimum costs results for this graph, considering that the starting node is A. O a. It is not possible to run Dijkstra's algorithm using this graph because nodes D and F are not accessible from node A, and this will cause an infinite loop O b. A-B = 2, A+0 = 1, A-E = 2, A-D = 0,A-F = 0 O c A-B = 2, A+0 = 1, A-E = 2, A-D = 3, A-F =4 O d. A-B = 2, A+0 = 1, A-E = 2, A-D = infinite, A- F = infinite De A-B =1, A+0 = 1, A-E = 1, A-D = 1, A-F = 1 Question 10 Not yet answered Marked outof 1.00 . Rap question The code snippet below does a certain operation for a set represented by bitvector. The bitvector elements are represented by their relative bit positions: 76543210 ( element order within bitvector) unsigned char bitvector=66; unsigned char temp=1; temp=temp