Let Tcomp(n, p) and Tcomm(n, p) denote the parallel computation and communica- tion times, respectively, on a parallel architecture for sorting n elements on p processors. Now consider routing a permutation on this architecture where each processor has a message of size m for another processor such that no two source or destination processors are the same. Design an algorithm to solve this permutation routing problem using only parallel sorting, and compute its run-time.

d. learned preferences i believe is your answer

the components of a vector are the parts of the vectors that are to each other.

b perpendicular

you'd use the equation that establishes a relationship between  energy  and  wavelength, which looks like this

e=h⋅cλ, where

λ  - the wavelength of the photon; c  - the speed of light, usually given as  3⋅108m/s; h  -  planck's constant, equal to  6.626⋅10−34j s

plug the value you were given for the energy of the photon in the above equation to get the wavelength

e=h⋅cλ⇒λ=h⋅ce

λ=6.626⋅10−34js⋅3⋅108ms−1.257⋅10−24j=1.581⋅10−1m