Q1. Define the given term:
a) Adjacency Matrix
b) Path Matrix
c) Adjacency list representation
For the given graph determine the adjacency matrix and adjacency list representation of the graph.
Q2. In brief describe and distinguish between the first-fit and best-fit memory allocation strategy.
Q3. describe any string matching algorithm. As well compute its time complexity.