can someone help me to solve it, please?

2. (25 pts) ( DAG -Topological Ordering). Consider the directed acyclic graph G below. Use the Queue method to find the topological ordering if exists. DAG 3. (15 pts) ( Graph Modeling] describe a graph that can be used to model the case described below. (What are the nodes/vertices, what are the edges, is it directed?) You are walking at a Hotel and you must greet every person you see before he/she greets you. You do not care how far you have to walk or who you greet first. (hotel hallways are two-way) i. Vertex: ji. Edge: iii. Directed/Undirected, explain