Consider the reference string: 0,6,5,1,4,5,0,5,3,6,5,5,2,3,2  Use the algorithms below with 3 frames and fill the table for each algorithm (including either the page fault (F) or Hit (H) in the last row). Please note that all the frames are initially empty (as indicated in the second to the left most column below) which will cause a page fault. Copy and fill the table below for each algorithm First In First Out (FIFO) Least Recently Used (LRU) Second Chance algorithm (extension of FIFO)

Draw the state of the array after a first pass of a shellsort with gap size 5, and then again after a second pass with gap size 3.

Given 3 strings, compare the all corresponding characters of all 3 strings and return similar characters at the similar indexs. The length of the strings could be different. getSimilars("ab", "ab", "ab")→ "ab" getSimilars("ab", "ac", "ad")→ "a" getSimilars("a", "ab", "abc") → "a" Go ...Save, Compile, Run (ctrl-enter)

Create four methods named insertionSort(), bubblesort(), mergesort() and quicksort(). Implement the sorting algorithms in the corresponding methods. In the main method, create four arrays a, b, c, d and initialize them with the same values. Pass these four arrays in four different functions. Create four instance variables named insertionSwap, bubbleSwap, countMerge, and countQuickSort and initialize them to 0. In methods insertionSort(), bubblesort() and quicksort(), increment the variables insertionSwap, bubbleSwap, and countQuickSort respectively by one whenever they call the method swap(). In method mergesort(), increment the variable countMerge by one to count the swaps. Use method swap() to swap the values.