Searching for a given element in a collection of data is one of the most fundamental operations in computer science. In the context of Algorithm Design Lab, searching algorithms are studied to understand how data can be examined efficiently to determine whether a particular element exists and, if it exists, where it is located. Two commonly studied searching techniques are Linear Search and Binary Search. Both algorithms solve the same basic problem, but they differ significantly in their working principles, requirements, time complexity, and efficiency. Linear Search can be applied to both sorted and unsorted data, whereas Binary Search requires the data to be sorted before searching. Linear Search, also known as Sequential Search, is the simplest searching algorithm. It searches for a given element by examining each element of the array one by one from the beginning until the required element is found or the entire array has been examined. Suppose an array contains the elements 15, 27, 9, 34, 18, 42, and 11, and the element to be searched is 34. Linear Search starts with the first element, 15, and compares it with 34. Since they are different, it moves to 27 and performs another comparison. It continues with 9 and 34. When it reaches 34, the search terminates because the required element has been found. The basic algorithm for Linear Search can be represented as follows. First, start from the first element of the array. Compare the current element with the target element. If both are equal, return the position of the element. If they are not equal, move to the next element. Continue this process until the element is found or the last element has been examined. If the search reaches the end of the array without finding the target, report that the element is not present. A simple pseudocode for Linear Search is: ```text LinearSearch(A, n, key) for i = 0 to n-1 if A[i] == key return i return -1 ``` Here, `A` represents the array, `n` represents the number of elements, and `key` represents the element that has to be searched. The return value gives the index of the element if it is found. A value of `-1` indicates that the element is absent. For example, consider the array: ```text A = [12, 25, 7, 31, 18, 40] ``` If the search element is 31, Linear Search performs the following comparisons: ```text 12 ≠ 31 25 ≠ 31 7 ≠ 31 31 = 31 ``` Thus, the element 31 is found at index 3, or at the fourth position when positions are counted from 1. If the search element is 50, the algorithm compares 50 with every element and finally reports that the element is not present. The major advantage of Linear Search is