The Toy

Problem Statement

The Toy Problem Description Jason has N number of toys, which are randomly placed in his shelf from left to right. Each toy is marked with a unique integer number based on its size. The toy numbers are represented in the form of an array T. He always places his favorite toy on the left most side of the shelf. Today Jason's sister saw the arrangement and arranged all the toys in the increasing order of the size. Your task is to find and return the new position of Jason's favorite toy. Input Specification: input1 : An integer value representing the number of toys in the array T input2 : An integer array T representing the size of all toys Output Specification: Return an integer value representing the new position of Jason's favorite toy Constraints All elements are unique elements. Consider 1-based indexing. Examples Example 1: Input: input1 = 5, input2 = [4,5,2,3,1] Output: 4 Explanation: In this scenario, there are a total of 5 toys. Jason's favorite toy is 4. After his sister re-arran