By using UNIX COMMANDS:

a$.$ Print the message containing your name and university number on the screen $.$

b$.$ List all files in the current directory Order by creation time.

c$.$ Create a file$1$ and write your name in it then Create a file$2$ and write your university

number in it $.$

d$.$ Concatenate two files together.

e$.$ Rename the new file to myfile.

f$.$ Create a file name is number than write the numbers from $1$ to $15,$ each number on a line.

g$.$ Displays$10$ lines from the head$($top$)$of a given file.

Consider the requests from processes in given order $300K,25K,125K,$ and $50K.$ Let there be

two blocks of memory available of size $150K$ followed by a block size $350K.$

Which of the following partition allocation schemes can satisfy the above requests?

A$)$ Best fit but not first fit.

B$)$ First fit but not best fit.

C$)$ Both First fit & Best fit.

D$)$ neither first fit nor best fit.

Use C Program to implement first fit & Best fit then explain the result.