Feasible Indices After Reduction

You are given an integer array arr of size n. All elements of arr are distinct.

You may perform either of the following operations any number of times:

1. Choose a non-empty prefix of the current array and delete every element in that prefix except the minimum element of the prefix.
2. Choose a non-empty suffix of the current array and delete every element in that suffix except the maximum element of the suffix.

After each operation, the remaining elements are concatenated to form the new array.

An index i is called feasible if it is possible to reduce the array to the single element [arr[i]]. Return a binary string of length n where the i-th character is '1' if index i is feasible, and '0' otherwise.