The below code is someone's implementation of binary search, but it is faulty. Describe how you would change the code to correct it$.$

public class Binarysearch$\{$

public int faultyBinarysearch$($int$[]$ arr, int x$)\{$

int $l=,r=$arr. length$-$l;

int $m=\frac{l+r}{2}$;

while

$m=\frac{l+r}{2}$;

if $)==(x$ return $m$;

if $)>(x$;

if $)$

$\{$