用C实现简单的可变分区的首次适应算法、内存回收算法的模拟，并将模拟运行的结果显示出来。假设内存空间实际大小是100M，共有3个作业请求使用内存空间，作业请求、释放内存空间的顺序如下：

　　作业A 申请30M内存空间 ――》 作业 B 申请 20M内存空间 ――》作业 A 释放内存空间 ――》 作业C 申请 50M 内存空间 ――》作业B 释放内存空间 ――》作业C释放内存空间。

要求输出每次内存分配、释放操作后，系统中已分配区情况表、未分配区情况表的内容

-Using C to achieve a simple variable partition algorithm to adapt the first time, memory recovery algorithm simulation, and simulation run results are displayed. The assumption that the actual memory size is 100M, operating a total of three requests for the use of memory space, operation request, the order of the release of memory space as follows: operation A to apply 30M memory space-　Operation B application 20M memory space-　Operation A release of memory space-　Operation C application 50M memory space-　the release of memory space operation B-　C to release memory space operation. Output of each memory allocation request, the release operation, the system has been allocated district table, unallocated areas Table of contents