add shuffle(::NTuple) to Random

[nsajko]

Fixes #56728

[nsajko]

It's also possible to rely on Memory getting stack-allocated, avoiding recursion:

Suggested change

	function _tuple_without_element_at_index(tup::(Tuple{T, Vararg{T, N}} where {T}), i::Int) where {N}
	clo = let tup = tup, i = i
	function closure(j::Int)
	k = if j < i
	j
	else
	j + 1
	end
	tup[k]
	end
	end
	ntuple(clo, Val{N}())
	end
	function shuffle(rng::AbstractRNG, tup::(Tuple{Vararg{T, N}} where {T})) where {N}
	if tup isa Tuple{Any, Vararg}
	let i = rand(rng, Base.OneTo(N)) # Fisher–Yates shuffle
	s = _tuple_without_element_at_index(tup, i)
	t = shuffle(rng, s)
	(tup[i], t...)
	end
	function shuffle(rng::AbstractRNG, tup::(Tuple{Vararg{T, N}} where {T})) where {N}
	if tup isa Tuple{Any, Vararg}
	@inline let # `@inline` and `@inbounds` are here to help escape analysis
	clo = @inbounds let mem = Memory{UInt16}(undef, N) # use `UInt16` to save stack space/prevent heap allocation
	copyto!(mem, Base.OneTo(N))
	shuffle!(mem)
	let mem = mem, tup = tup
	function closure(i::Int)
	@inbounds tup[mem[i]]
	end
	end
	end
	ntuple(clo, Val{N}())
	end

This suggestion depends on #56847 getting merged first.