Given three arrays arr1, arr2 and arr3, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. Meanwhile, all elements in arr2 are also in arr3. Sort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2. Elements that do not appear in arr2 should be placed at the end of arr1 in ascending order. Meanwhile, Elements for arr3 that do not appear in arr2 should be placed at the front of arr1 in ascending order. For example,
arr1:[2,4,3,5,6,1,9]
arr2: [2,4,3]
arr3: [2,4,3,11,8,13]
the output should be (8,11,13,2,4,3,1,5,6,9] since [2,4,3] shared by arr1, arr2, arr3. Elements [11,8,13] should have a ascending arder in front of arr1, and elements [5,6,1,9] have an ascending order at the end of arr1.
You can define your input arrays.