-
Re-implement the Bitwise Microlab using BitSet instead of integers.
-
Write a function that takes a BitSet and returns the number of steps needed to shift all
1
bits to the left (maintaining the samelength()
of the BitSet). -
Write a function that takes a BitSet and returns the number of steps needed to shift all
1
bits to the right.