Suppose you want solve a TSP instance of size 100 using brute force (checking all possible permutations). 1. Suppose you run your program on a computer that can visit a permutation every 1ns. How long does it take to solve your TSP instance? 2. It is estimated that the universe contains around 1080 atoms. If you could transform every single atom in the universe into a computer that can visit a permutation every 1ns, how long does it take to solve your TSP instance?