Use python

The twin primes are pairs of primes that have a difference of 2. The first several twin primes are: (3,5),(5,7), (11,13.. Use the following faster version of isPrime(n) to (1) print out the first 100 twin primes, 5 per line (2) find their sunm (3) Find the sum of the first 50 twin primes divided by the sum of the 51st to the 100th twin primes. For the first 100 twin primes, what consecutive twin primes have the largest (4) gap and what is that gap? For consecutive twin primes (a,b), (c,d), the gap between them is defined to be c-b Show all your output. You must use isPrime(n) as a helper function. The faster version of isPrime(n) is shown below: Show all your output. You must use isPrime(n) as a helper function. The faster version of isPrime(n) is shown below: import math def isPrime (n): Orw returns False.'' Return True if int n> o is a prime, ifn 1: elif n2: else: return False return True return False else: I for f in range (3,math.ceil ( (math.sqrt (n)))+1,2) return False return True