Prints intersection of arr1 [ 0. . n1 - 1 ] and arr2 [ 0. . n2 - 1 ]
public void findPosition ( int [ ] a , int [ ] b ) { int v = ( a . Length + b . Length ) ; int [ ] ans = new int [ v ] ; int zero1 = 0 ; int zero2 = 0 ; Console . Write ( " Intersection ▁ : ▁ " ) ;