ng foundIndex } } } } } public static void main(String[] args) { // Fill array with random numbers between 0-99 int[] arr = new int[SIZE]; for (int i = 0; i < SIZE; ++i) { arr[i] = (int) (Math.random() * 100); } Thread[] threads = new Thread[NUM_THREADS]; int key = 19; for (int i = 0; i < NUM_THREADS; ++i) { final int threadId = i; threads[i] = new Thread(() -> LinearSearch(threadId, arr, key)); threads[i].start(); } for (Thread thread : threads) { try { thread.join(); } catch (InterruptedException e) { e.printStackTrace(); } } if (foundIndex == -1) { System.out.println("Element not found in the array."); } else { System.out.println("Element found at index: " + foundIndex); } } } 3e:T696,#include #include #include #include #include // for rand() const int SIZE = 280000; const int NUM_THREADS = 4; std::mutex mtx; // Mutex for controlling access to foundIndex int foundIndex = -1; void LinearSearch(int threadId, const std::vector& arr, int key) { int chunkSize = arr.size() / NUM_THREADS; int start = threadId * chunkSize; int end = (threadId == NUM_THREADS - 1) ? arr.size() : start + chunkSize; for (int i = start; i < end; ++i) { // Early exit if foundIndex is set by another thread { std::lock_guard guard(mtx); if (foundIndex != -1) { break; } } if (arr[i] == key) { std::lock_guard guard(mtx); if (foundIndex == -1) { foundIndex = i; break; // Exit after setting foundIndex } } } } int main() { // fill array with random numbers between 0