Let $A$ and $B$ are two arrays of size $n$ with positive integer values and let $k$ be any positive integer. Design an algorithm to solve the following problem. For each index $i$ ($1\leq i \leq n$) either select $A[i]$ or $B[i]$ but not both such that the sum of the elements picked from the a...