Given an array $A(I)$ of $10016-$bit signed numbers stored in memory starting at address $A{000}_{16},$ write a program to generate two arrays from the given array such that one array $P(J)$ consists of all the positive numbers and the other $N(K)$ contains all the negative numbers. Store the array of positive numbers in memory starting at offset address $B{000}_{16}$ and the array of negative numbers starting at offset address $C{000}_{16}.$