An 8-bit register is used to track the status of 8 separate entities (i. e. it is a bit-vector), with 1 signifyiny the unit is free, 0 that it is busy. As always, the bits are labelled from right to left as 0 through 7 For questions a) through d), provide the appropriate bit-mask and operation (and, or, not, xor) required to accomplish the task, and the outcome that answers the query. Remember: 1 => free; 0> busy a) Determine whether unit 2 (the third unit) is free or busy; what outcome indicates that it is busy? bit-mask: operation: outcome if unit 2 is busy:b) Determine if both machines 2 and 6 are free; what outcome indicates that they are free? bit-mask: operation: outcome if both units are free:c) Determine if all units are busy (i. e. no units are free); what outcome indicates that it is is the case? bit-mask: operation: outcome if all units are busy:d) Determine if all units are free (i. e. no units are busy); what outcome indicates that it is is the case? bit-mask: operation: outcome if all units are free:e) Force unit 5 to busy (0), leaving all other units unchanged. The outcome of the operation will be written back over the original bit-vector. bit-mask: