Python pls

Define function pre_taker. This function is an iterative function that returns a list inside the list. The function use callable to find the element that fits in, and using n to get how long each list is.

def pre_taker (itez, n, p):

#This function must be an iterative function but do not import any tools such as itertools

#There should be only one function. Do not create any other helper function, function should be only one

Output

Before test all the output copy these functions first

def hide(iterable): for v in iterable: yield v

def nth(iterable, n): for i,v in enumerate(iterable,1): if i == n: return v return None

output

list(pre_taker('a.bcde.f.g.hijk',2,lambda x:x=='.'))-->[['a', '.'], ['e', '.'], ['f', '.'], ['g', '.']]

list(pre_taker(hide('ab.defghi.klmn.pqrst.vwz.z'),5,lambda x : x=='.'))-->[['a', 'b', '.'], ['f', 'g', 'h', 'i', '.'], ['k', 'l', 'm', 'n', '.'], ['q', 'r', 's', 't', '.'], ['.', 'v', 'w', 'z', '.']]

list(pre_taker(hide([1,2,3,4,5,6,7,8,9]),3,lambda x : x%2==1))-->[[1], [1, 2, 3], [3, 4, 5], [5, 6, 7], [7, 8, 9]]

nth(pre_taker(ints(),5,is_prime),10) --> [25, 26, 27, 28, 29]