1. Determine whether a linked list contains a loop as quickly as possible without using any extra storage. Also, identify the location of the loop.
2. Give an algorithm for finding an ordered word pair (e.g., "New York") occurring with the greatest frequency in a given webpage. Which data structures would you use? Optimize both time and space.