You are given two arrays representing integer locations of stores and houses (each location in this problem is one-dimensional). For each house, find the store closest to it. Write a function: vectorint> &houses) s olution (vectornt> &stores, vectornt> that, given two arrays: stores of length M representing integer locations of the stores houses of length N representing integer locations of the houses returns an integer array of size N. The i-th element of the returned array should denote the location of the store closest to the i-th house. If many stores are equidistant from a particular house, choose the store with the smallest numerical location. Note that there may be multiple stores and houses at the same location. Assume that: . M and N are integers within the range [1..1,000]; . each element of arrays stores, houses is an integer within the range [0.1,000,000]