SortedSet.Overlaps is O (n log m)

[Current implementation](https://github.com/dotnet/runtime/blob/add51b82baf268c3678bdd124480a46b89d72ce4/src/libraries/System.Collections/src/System/Collections/Generic/SortedSet.cs#L1319) performs iteration over `other` which calls `Contains`:

 ```c#
foreach (T item in other)
{
	if (Contains(item))
	{
		return true;
	}
}
```

And Contains is `O(log m)` ([docs](https://learn.microsoft.com/en-us/dotnet/api/system.collections.generic.sortedset-1.contains?view=net-6.0#remarks), [implementation](https://github.com/dotnet/runtime/blob/add51b82baf268c3678bdd124480a46b89d72ce4/src/libraries/System.Collections/src/System/Collections/Generic/SortedSet.cs#L693))

Author: gurustron

xml/System.Collections.Generic/SortedSet`1.xml

@@ -1707,7 +1707,7 @@
 ## Remarks  
  Any duplicate elements in `other` are ignored.  
   
- This method is an `O(n)` operation, where `n` is the number of elements in `other`.  
+ This method is an `O(n log m)` operation, where `m` is <xref:System.Collections.Generic.SortedSet%601.Count%2A> and `n` is the number of elements in `other`.  
   
  ]]></format>
         </remarks>