$11\mathrm{.}6$ Describe how exactly you would perform a collision search to find a pair x$1,$ x$2$ such that h$($x$1)=$ h$($x$2)$ for a given hash function h$.$ What are the memory requirements for this type of search if the hash function