Push down topk through join

[SubhamSinghal]

Which issue does this PR close?

#11900

Rationale for this change

When a query has ORDER BY <cols> LIMIT N on top of an outer join and all sort columns come from the preserved side,
DataFusion currently runs the full join first, then sorts and limits. We can push a copy of the Sort(fetch=N) to the preserved input, reducing the number of rows entering the join.

Before:

Sort: t1.b ASC, fetch=3
   Left Join: t1.a = t2.a
     Scan: t1     ← scans ALL rows
     Scan: t2

After:

  Sort: t1.b ASC, fetch=3
    Left Join: t1.a = t2.a
      Sort: t1.b ASC, fetch=3  ← pushed down
        Scan: t1               ← only top-3 rows enter join
      Scan: t2

What changes are included in this PR?

A new logical optimizer rule PushDownTopKThroughJoin that:

1. Matches Sort with fetch = Some(N) (TopK)
2. Looks through an optional Projection to find a Join
3. Checks join type is LEFT or RIGHT with no non-equijoin filter
4. Verifies all sort expression columns come from the preserved side
5. Inserts a copy of the Sort(fetch=N) on the preserved child
6. Keeps the top-level sort for correctness

Are these changes tested?

Yes through UT

Are there any user-facing changes?

No API changes.

[martin-g]

This condition looks a bit broad.
If the child has no fetch limit or a larger fetch limit than the current one then pushing down the current Sort with its fetch limit would be beneficial, no ?
The optimization should be skipped only if the Sort expr is different or its fetch limit is non-zero but smaller than the current one.

[martin-g]

Suggested change

	DROP TABLE t2;
	DROP TABLE t2;

nit: add an empty line at the end to make it Unix-friendly.

[martin-g]

Please add tests for:

1. LEFT/RIGHT SEMI/ANTI JOINs
2. LEFT and/or RIGHT JOIN with ORDER BY t1.b, t2.y LIMIT 3 (multiple sort columns from both sides)
3. LIMIT N OFFSET M