package lec1;
public class intersectionofa rrays{
public static void insertionSort(i nt[] arr){
//write your code here
int j=0,k=0;
for(int i=0;i<arr.lengt h;i++)
{
k=arr[i];
j=i-1;
while(k<arr[j] && (j>=0))
{
arr[j+1]= arr[j];
j--;
}
arr[j+1]=k;...