How many comparisons $($both successful and unsuccessful$)$ will be made by the brute$-$force algorithm

$($shown in the textbook$)$ in searching for each of the following patterns in the binary representation of

decimal number $65536?$

a$.0000$

b$.1000$

c$.0101$