Convert the given C$++$ function, which implements binary search on a sorted array, into MASM assembly language.

int binarySearch$($int arr$[],$ int left, int right, int x$)\{$

while $($left $<=$ right$)\{$

int mid $=$ left $+($right $-$ left$)/2$;

$//$ Check if x is present at mid

if $($arr$[$mid$]==$ x$)$

return mid;

$//$ If x greater, ignore left half

if $($arr$[$mid$]<$ x$)$

left $=$ mid $+1$;

$//$ If x is smaller, ignore right half

else

right $=$ mid $-1$;

$\}$

$.$data

; Define the input array

arr DWORD $2,3,4,10,40$

; Define variables for left and right indices

left DWORD $?$

right DWORD $?$

; Define variable for search value

x DWORD $10$

; Define variable to store result

result DWORD $?($Only in MASM$)$