M (no subject) - 52016293116.sol X Bb Take Test: ITDR3103 - Data Stru Heap Data Structure output.pdf G Consider the following graph. + f c bb.cas.edu.om/webapps/assessment/take/take.jsp?course_assessment_id=_7836_1&.course_id=_14330_1&content_id=_170788_18.question_num_4.x=0&toggle_st... : Question Completion Status: A Click Submit to complete this assessment Question 4 of 4 Question 4 10 points Save Answer Consider the following graph. You need to travel between the different cities using the BFS and DFS algorithms. You Journey will start from Muscat Muscat Hima Nizwa Thamreet Adam Bahla AlDuqum Salalah (a) What is the type of data structure you will use in BFS? In what order will the nodes be visited using BFS? (5 marks) (b) What is the type of data structure you will use in DFS? In what order will the nods be visited using DFS? (5 marks) Attach File Browse My Computer A Click Submit to complete this assessment.