12. If some resources have only a single instance, then we can use the wait-for graph. True False

12. If some resources have only a single instance, then we can use the wait-for graph. True False answer with true or false no explanation needed

Consider the equals() method from the java.util.AbstractList class.  (a) Draw a control flow graph for this method. Several possiblevalues can be used for the node number in the graph. Choosesomething reasonable.(b) Label edges and nodes in the graph with the corresponding codefragments. You may abbreviate predicates as follows whenlabeling your graph:A: o == thisB: !(o instanceof List)C: e1.hasNext() && e2.hasNext()C: e1.hasNext() && e2.hasNext()D: !(o1 == null ? o2 == null :o1.equals(o2))E: !(e1.hasNext() $\parallel$ e2.hasNext())(c) Node coverage requires (at least) four tests on this graph.Explain why.