You are given two arrays of size N. Each array contains numbers from 1 to N. (No repetition) We define 1 operation by the following: 1 - You can pick any number from the array. 2 - You can place the number at the start or end of the array. You are required to convert the second array into the first one using a minimum number of operations. CONSTRAINTS 1 <= N <= 1046 PARTIAL MARKING 50% (In case of Array 1 is sorted) INPUT FORMAT N First Array Second Array OUTPUT FORMAT An Integer denoting the number of operations rEXAMPLE 6 423516 365 412 ANSWER 3 One possible way to do that 1 - Pick number 2 and put it at the start of the array. Array after the 1st Operation [2, 3, 6, 5, 4, 1] 2- Pick number 4 and put it at the start of the array. Array after the 2nd Operation [4, 2, 3, 6, 5, 1] 3 - Pick number 6 and put it at the end of the array Array after the 3rd Operation [4, 2, 3, 5, 1, 6]