We're supposed to do this in Linux operating system. I'm new to Linux and dont know what to do. The blue links in Binary and sequential box are to be pasted in directory. An answer would really help me for this lab.

You can store your work for this part in the Searching directory You have been given the code for performing a Binary Search and the code for performing a Sequential Search. If you need them again, you can copy them now Binary Search cp et/data/ftp/pub/class/170/ftp/cpp/BinarySearch/BinSearch.h BinSearch.h cp et/data/ftp/pub/class/170/ftp/cpp/BinarySearch/BinSearch.cpp BinSearch.cpp cp et/data/ftp/pub/class/170/ftp/cpp/BinarySearch/BinHain.cpp BinMain.cpp Sequential Search cp et/data/ftp/pub/class/17e/ftp/cpp/BinarySearch/SeqSearch.h SeqSearch.h cp et/data/ftp/pub/class/170/ftp/cpp/BinarySearch/seqsearch.cpp SeqSearch.cpp cp et/data/ftp/pub/class/170/ftp/cpp/BinarySearch/Seqlain.cpp Seqain.cpp Step 1-Modify the Binary Search To get a better understanding of how the Binary Search is working, add some statements to the routine. i.e. Make these changes in BinSearch.cpp . Create a local variable in the BinarySearch function called "LoopCtr" and initialize it to 1 . After the Difference = IntArray(Mid-Target; statement, add some cout statements to print the values of Target : id: Difference: LoopCtr: .After your new cout statements, add these statements PrintArray (IntArray, Mid)i LoopCtr++; Step 2-Compare the Runs Run the code and search for the first, middle, and last items. Based on your observations, construct the following table in a file and save it to show your lab instructor equential Binar Is the data sorted? (yes or no) How many comparisons are made to find the first item (index 0)? How many comparisons are made to find the middle item (index 49)? How many comparisons are made to find the last item (index 99)