write a code that solvea the following problem

the code can be written in java , c++ or python

Problem#4 You have a multiset containing several integers. Initially, it contains al elements equal to 1, a2 elements equal to 2, ..., an elements equal to n. You may apply two types of operations: . choose two integers land r (Isr), then remove one occurrence of I, one occurrence of l+1, ..., one occurrence of r from the multiset. This operation can be applied only if each number from 1 to r occurs at least once in the multiset choose two integers i and x (x21), then remove x occurrences of i from the multiset. This operation can be applied only if the multiset contains at least x occurrences of i . What is the minimum number of operations required to delete all elements from the multiset? Sample 1 - Input: 1411 Sample 1 - Output: 2 Sample 2 - Input: 1 0 1 0 1 Sample 2 - Output: 3 Explanation of sample 1 1411 a1 = number of occurrence for number 1 is 1 a2 = number of occurrence for number 2 is 4 a3 = number of occurrence for number 3 is 1 a4 = number of occurrence for number 4 is 1 = This multiset equivalent to {1, 2,2,2,2,3,4} solution : Use first operation from (1 = 1 to r = 4) result: {2,2,2} Use second operation (i = 2 and x= 3) result: {}