NEED ALLL PLZZ

With reference to the previous question on the hypothetical "Montclair Graph M", which of the following claims is/are True? Claim 1: M contains a cycle Claim 2: M is strongly connected (Note: you must only use the information provided in these two questions for this analysis). O Both Claim 1 and Claim 2 are True o Only Claim 2 is True Neither Claim 1 nor Claim 2 are True Only Claim 1 s True You are hired as a Computer Scientist in a company and your team encounters the acronym DAG in a document. The following are all correct expansions of the the acronym DAG as found on the Web. Thus, there is some disambiguation needed, where you are asked for quick help. The document is in the context of designing a system for course prerequisites and their ordering, with precedence constraints. Given that, what will you mention to the team as the typical full form of DAG, most probably correct in this context? O Defense Acquisition Guide Directed Acyclic Graph Database Availability Group Deputy Attorney General In which of the following applications would a "DAG" from the previous question be THE MOST useful where topological ordering and precedence constraints are involved? GUI Containment for User Friendly interfaces (to organize widgets attractively) Tracing the shortest Pathina Maze (where directions do not matter) Assembly Line Job Scheduling (where output of one job affects input of another Friend Finder in a Social Network to give invitations to all friends in a given city