PYTHON help please, not sure where to start

Write a Numpy function that computes the intersection (i.e. the elements in common) of two Numpy one-dimensional arrays without using for ioops. You can assume that there are no repeated values in each of the two input arrays. Include code that verifies that your code works correctly. For example, the result of applying intersection to the arrays [1,2,5,6] and [2,3,5,7] should be the array that contains [2,5] defintersection(a,b)returnnp.array((1,2,)]) T1. coge for testing wour timitenentotion of (ntersection Cmwat You heed to implement this from sctatch without using any Numpy buit in functions like intersect id in id and unique For your solution use the following approach. - Concatenste the two arrays using np concalenate - Sort the resulting artay using np sort