(a) 2 SSC, SAB, SB, SAD (b) 2 SAB, SB, SAD, SCB (d) 3[SC,SAB,SAD,SB] (e) x[SB,SAD,SCB,SABD] 8. [2 pt.] Using Uniform Cost Search (UCS), how many steps are required to reach the final solution, and be the status of the queue at the final step? (a) 6 steps, [SABDG, SABG, SAD, SB, SC] (b) 9 steps, [SBD, SABG, SBG, SADG, SCBD, SCBG, SABDG] (c) 5 steps, (SABG,SABDG, SAD, SB, SC) (d) 10 steps, [SABG, SBG, SADG, SCBD, SCBG, SABDG, SBDG (e) 6 steps, [SADG, SABG, SAD, SB, SC] 9. [3 pts] Using the A search algorithm (A), with the graph and the heuristics given below, what number of steps required to reach the final solution, and the status of the queue at the final step, w (a) 9 steps, [SBG:4, SADG:5] (b) 9 steps, [SABG:4, SADG:5, SB:5, SCB:6] (c) 9 steps, [SBG:6, SADG:6] (d) 9 steps, [SCBG:5, SAB:5, SB:5, SCB:6] (e) 8 steps, [SADG:4, SAB:5, SC:1, SCB:6]