Convert this code to risc v v. #include int binarySearch(int arr[], int I, int r, int x) { while (I

Convert this code to risc v v.

#include .h>

int binarySearch(int arr[], int I, int r, int x)

{

while (I <=r) {

int mid=1+ (r - 1) / 2;

if (arr[mid] == X)

return mid;

if (arr[mid]

I = mid + 1;

else

r = mid - 1;

}

return -1;

}

int main() {

int arr[] = {2, 4, 11, 34, 56, 40};

int n = sizeof(arr) / sizeof(arr[0]);

int x = 56;

int result = binarySearch(arr, 0, n - 1, x);

if (result == -1) printf("Element is not present in array");

printf("Element is present at index %d", else result);

return 0;