Write a function in C++, given an unsigned integer storing a bit pattern and an unsigned integer with a search bitstring, returns an integer whose contents have been left-shifted so that the search pattern is in the leftmost bit position of the integer. NOTE: Dont forget that were working with integers storing binary data, not character strings. This means that you will need to use C++ bitstring support.

I don't have any sample input or output.