The edges of a directed graph are as follows: $($A$,$ B$,3),($B$,$ C$,5),($C$,$ D$,6),($A$,$ H$,12),($A$,$ E$,71,($E$,$ F$,8),($F$,$ J$,11),($F$,$ G$,5),(0,$ K$,14),($K$,$ M$,171,10,$ H$,$

$9),($H$,$ L$,10).$ The edge in each of these triplets is directed from the first element to the second element. The last alement of each triolet is the neight of the edge. Tree search search is used to find suitable paths in this graph. Assume that the cost of a path is the sum of the costs of edges on the path.

State if each of the following statements based on this graph is true or folse, using aT for a true statement and on F for a false statement.

$1.$The cost of path A$-$B$-$C$-$D is $14.$

$2.$There is a path in the graph whose cost is $20.$

$3.$There is a path in the graph whose cost is $19.$

$4.$It is not possible to generate a search