Given a sorted $($in ascending order$)$ Python list of distinct integers, return all the indices i such that the elements

at index i equals i$.$ There may be more than one such index, so the return type is a Python list containing all

indices that satisfy the criteria.

Write two functions for the same problem. The first function, linearSearchValueIndexEqual, uses linear search, and the

second function, binarySearchValueIndexEqual, uses binary search. The test cases for the two functions in Gradescope

are the same.

When the input list is empty, return an empty list.