package main import "fmt" func binarySearch(arr []int, target int) int { left := 0 right := len(arr) - 1 for left <= right { mid := left + (right-left)/2 if arr[mid] == target { return m