Bottleneck traveling salesperson decision problem: Given a graph and a number M, the bottleneck traveling salesperson decision problem is to determine whether there exists a Hamiltonian cycle in this graph such that the longest edge of this cycle is less than M. Show that the bottleneck traveling salesperson decision problem is NP-complete. Bottleneck traveling salesperson decision problem: Given a graph and a number M, the bottleneck traveling salesperson decision problem is to determine whether there exists a Hamiltonian cycle in this graph such that the longest edge of this cycle is less than M. Show that the bottleneck traveling salesperson decision problem is NP-complete