Given an array of N integers, your task is to transform this array into a permutation of the first N positive integers. A permutation of N is an arrangement of numbers such that each number from $1$ to N appears exactly once.In one operation, you can increase or decrease any element of the array by $1.$The challenge is to figure out the smallest number of such operations required to convert the given array into a permutation.Examples:Input N$=[3,2,1,4]$Output: $0$Explanation: No operation needed; already a permutation$2.$ Input N$=[4,1,4,2]$Output: $1$Explanation: Decrease one $\text{'}4\text{'}$ to $\text{'}3\text{'}$ to for e permutation $4,1,3,2$Constraints:The integers in the array N$[$i$]$ will be equal or bigger than $1.$