Given two arrays: A[0..m-1] and
B[0..n-1]. Find whether B[] is a subset of A[] or not. Both the
arrays are not in sorted order. It may be assumed that elements in
both array are distinct. Design an O(n) time algorithm that solves
this problem. Provide pseudocode
Ex:
Input: A[] = {11, 1, 13, 21, 3, 7}, B[] = {11, 3, 7, 1}
Output: B[] is a subset of A[]
Input: A[] = {1, 2, 3, 4, 5, 6}, B[] =...