Relative Sorting Problem Statement

You are given two arrays, 'ARR' of size 'N' and 'BRR' of size 'M'. Your task is to sort the elements of 'ARR' such that their relative order matches that in 'BRR'. Any elements in 'ARR' not found in 'BRR' should be appended at the end in sorted order.

Example:

Input:

ARR = {9, 5, 8, 4, 6, 5}
BRR = {8, 4, 5}

Output:

{8, 4, 5, 5, 6, 9}

Constraints:

• 1 <= T <= 5
• 1 <= N <= 10^5
• 1 <= M <= 10^5
• -10^9 <= ARR[i], BRR[i] <= 10^9
• Time limit: 1 sec

Note:

Elements of 'BRR' are non-repeating.

Additional Information:

This function only needs implementation; the output is automatically handled elsewhere.