Which of the following is correct about how the compare$-$and$-$exchange process is performed?

In cases where a process may only hold the elements of the list to be sorted, processes cannot exchange data with each other.

In cases where a process may only hold the elements of the list to be sorted, processes can exchange data with each other during the comparison.

In the case of parallel programs, the comparison and exchange is easier than sequential sorting.

In the case of sequential sorting, the comparison and exchange of two elements is complex.