#include <stdio.h>
#include <string>
#include <vector>
#include <limits.h> // for INT_MAX
#include <iostream>

typedef std::string SS;
typedef std::vector<SS> VS;

#define MAX_FRAMES 20
#define MAX_ENTRIES 5000

typedef struct{
unsigned int number;
unsigned int future;
unsigned int hits;
unsigned int clock;
} frame;

bool search(int key, std::vector<int>& fr)
{
for (int i = 0; i < fr.size(); i++)
   if (fr[i] == key)
         return true;
return false;
}

int predict(int pg[], std::vector<int>& fr, int pn, int index)
{

int res = -1, farthest = index;
for (int i = 0; i < fr.size(); i++) {
   int j;
   for (j = index; j < pn; j++) {
         if (fr[i] == pg[j]) {
            if (j > farthest) {
               farthest = j;
               res = i;
            }
            break;
         }
   }
   if (j == pn)
         return i;
}
return (res == -1) ? 0 : res;
}

void optimal(int pages[], int page_no, int frame_no)
{

std::vector<int> fr;
int hit = 0;
for (int i = 0; i < page_no; i++) {

   // Page found in a frame : HIT
   if (search(pages[i], fr)) {
         hit++;
         continue

1. Provide the detailed steps involved in performing an output oper...