Use python only and show the code of your IDE. You are given two arrays: Array1 andArray2.Array1 will be sorted. For each elementv in Array2, you need to write apseudocode that will print the numberof elements in Arr1 that is greater thanor equal to v and the element mustbe a prime number. For example: if Igive you two arrays of size 5 and 45 4 [size of two arrays]Arri = 13579Arr2 = 6 4 8The output should be: 12 oThere are two parts in the question.First you need to know how manynumbers are there in Array1 which aregreater than 6. Here, we find there aretwo numbers (7,9). Then we need tofind whether these numbers are primeor not. The searching portion must nottake more than O(log n) time.Sample inputSample output552311137 10 12 1761 14 8 9

Actually, python is a easiest programming language. It is a dynamically typed programming language.

You are given two arrays: Array1 and Array2. Array1 will be sorted. For each element v in Array2, you need to write a pseudocode that will print the number of elements in Arr1 that is greater than or equal to v and the element must be a prime number. For example: if I give you two arrays of size 5 and 4 54 [size of two arrays] Arri = 13579 648 The output should be: 12 o Arr2 = There are two parts in the question. First you need to know how many numbers are there in Array1 which are greater than 6. Here, we find there are two numbers (7,9). Then we need to find whether these numbers are prime or not. The searching portion must not take more than O(log n) time. Sample input Sample outpu 55 37 10 12 17 6114 8 9 23111