Perm Check
Problem A non-empty array A consisting of N integers is given. A permutation is a sequence containing each element from 1 to N once, and only once. For example, array A such that: is a permutation, but array A such that: is not a permutation, because value 2 is missing. The goal is to check whether…