Please do not use any codes or psudecodes the answer will be descriptive and problem solving not coding

a) The following diagram shows a DAG that represents a number of events e = {1, 2, 3, 4, 5, 6} that needs to be carried out. 2 5 1 4 3 6 The diagram shows the dependencies of events. For example, you need to complete event 1 before you start event 2 or 3. Suppose, the objective is to find a linear ordering of the vertices such that if (u, v) is an edge, then u preceeds v in the ordering. Explain how would you determine this linear ordering and state the time complexity of the algorithm