sstable: fix issue with comparing suffix during SeekPrefixGE lazy positioning

During a RangeDelIter the prefix passed might not be the same the prefix of the key
therefore we need to split the prefix from the given key.

Part of #2002
Previous #5256

Author: Sachuman

sstable/reader_iter_single_lvl.go

@@ -863,7 +863,8 @@ func (i *singleLevelIterator[I, PI, D, PD]) SeekPrefixGE(
 		// table's max suffix, return a synthetic key with that max suffix.
 		// We'll only actually perform the seek if the synthetic key rises to
 		// the top of the iterator's heap, and the iterator is Nexted.
-		if ok && maxSuffix != nil && i.cmp(key[len(prefix):], maxSuffix) < 0 {
+		// During a RangeDelIter, the prefix passed and the prefix in the key might not be the same.
+		if ok && maxSuffix != nil && i.reader.Comparer.ComparePointSuffixes(key[i.reader.Comparer.Split(key):], maxSuffix) < 0 {
 			smallest := i.readEnv.InternalBounds.SmallestUserKey()
 			smallest = i.reader.Comparer.Split.Prefix(smallest)
 			largest := i.readEnv.InternalBounds.LargestUserKey()

sstable/reader_iter_two_lvl.go

@@ -466,7 +466,8 @@ func (i *twoLevelIterator[I, PI, D, PD]) SeekPrefixGE(
 		// table's max suffix, return a synthetic key with that max suffix.
 		// We'll only actually perform the seek if the synthetic key rises to
 		// the top of the iterator's heap, and the iterator is Nexted.
-		if ok && maxSuffix != nil && i.secondLevel.cmp(key[len(prefix):], maxSuffix) < 0 {
+		// During a RangeDelIter, the prefix passed and the prefix in the key might not be the same.
+		if ok && maxSuffix != nil && i.secondLevel.reader.Comparer.ComparePointSuffixes(key[i.secondLevel.reader.Comparer.Split(key):], maxSuffix) < 0 {
 			smallest := i.secondLevel.readEnv.InternalBounds.SmallestUserKey()
 			smallest = i.secondLevel.reader.Comparer.Split.Prefix(smallest)
 			largest := i.secondLevel.readEnv.InternalBounds.LargestUserKey()