Step through BFS (Breadth-First Search) in the graph below, and indicate the enqueue and the dequeue order/time for each vertex (note that A is the first node enqueued). B Node Enqueue Time A 1 Dequeu Time B D E Finish a pseudo-code algorithm for printing binary search tree node keys in ascending order. Hint: you can call Print_Descending() on left and right child of a node Print_Descending(v) Print(v) Give examples when you would use Roster notation and when Builder notation while defining sets in applications. Why you need both? Draw the arrow diagram and the matrix representation for each relation: S={a, b, c, d} T={6, 7,8} R={(a,6),(a,7),(b,7),(1,8),(0,6),(0,8),(d,7)} C. Set true/false for each statement: a. -0.1 E R+ b. 10/5 EN -10 ER d. -7 Z+ e. 55{1,6, a, {55},5} f. 216{x: XE N, xis prime } g. a E{{a, b,c}}