Consider the following function that implements acquiring a lock $($assume that TestAndSet is an atomic instruction$).$ Observe that this code's approach to waiting for a held lock to be released is to "spin". void lock $($lock$\_$ t $*$lock$)1$while $($TestAndSet $($&lock$->$flag, $1)==1)$; $//$ spin$-$wait $($do nothing$)$i$)$ Briefly explain why the way this code spins is inefficient and wastes resources.ii$)$ Briefly explain how this code could be modified to avoid that inefficiency. $($Hint: we studied two different strategies; either is an acceptable answer here$)$