$k=|$~$lo{g}_2(n)$~$|$

$n$ : Number of required subnets.

$k$ : Number of bits to borrow from the host part.

$*$ : Ceiling function, which rounds up to the

nearest whole number.

Calculation Steps:

Determine $n$ : Decide how many subnets are

needed.

Calculate $lo{g}_2(n)$ : Find the base$-2$ logarithm of $n$

to determine how many times $2$ needs to be

multiplied by itself to reach $n.$

Apply the Ceiling Function: Round up to ensure

you have enough bits to create at least $n$

Resulting $k$ : The number of bits you need to

borrow.

Now apply the calculation process explained

above. Start by adding $10$ to today's date. For

instance, if today is the $12$th$,$ use the value $22.$

The number of bits you need to borrow to create

this number of subnets is