2 A student is trying to find the solution to the travelling salesperson problem for a network.
They correctly find two lower bounds for the solution: 15 and 19
They also correctly find two upper bounds for the solution: 48 and 51
Based on the above information only, which of the following pairs give the best lower bound and best upper bound for the solution of this problem?
Tick ( ✓ ) one box.
| Best Lower Bound | Best Upper Bound | |
| 15 | 48 | □ |
| 15 | 51 | □ |
| 19 | 48 | □ |
| 19 | 51 | □ |
The simple-connected graph \(G\) has the adjacency matrix
| \cline { 2 - 5 }
\multicolumn{1}{c|}{} | \(A\) | \(B\) | \(C\) | \(D\) |
| \(A\) | 0 | 1 | 1 | 1 |
| \(B\) | 1 | 0 | 1 | 0 |
| \(C\) | 1 | 1 | 0 | 1 |
| \(D\) | 1 | 0 | 1 | 0 |
Which one of the following statements about \(G\) is true?
Tick ( ✓ ) one box.
\(G\) is a tree □
\(G\) is complete □
\(G\) is Eulerian □
G is planar □