write an efficient algorithm for the following assumptions: 1. N is an integer within the range [2.. 100,000]; 2. M is an integer within the range [1.. 100,000]; 3. All the elements of arrays A and B...

Extracted text: write an efficient algorithm for the following assumptions: 1. N is an integer within the range [2.. 100,000]; 2. M is an integer within the range [1.. 100,000]; 3. All the elements of arrays A and B are integers within the range [1..N]; 4. There are no self loops (edges with A[K]=B[K]) in the graph; 5. there are no multiple edges between the same vertices; 6. N*M is smaller than or equal to 1,000,000,000