说明：  ⑴ 用C语言分别实现采用首次适应算法和最佳适应算法的动态分区分配过程alloc（）和回收过程free（）。其中，空闲分区通过空闲分区链来管理；在进行内存分配时，系统优先使用空闲区低端的空间。 ⑵ 假设初始状态下，可用的内存空间为640KB，并有下列的请求序列：  作业1申请130KB。  作业2申请60KB。  作业3申请100KB。  作业2释放60KB。  作业4申请200KB。  作业3释放100KB。  作业1释放130KB。  作业5申请140KB。  作业6申请60KB。  作业7申请50KB。  作业6释放60KB。 分别采用首次适应算法和最佳适应算法进行内存块的分配和回收，要求每次分配和回收后显示出空闲内存分区链的情况。
(⑴ using C language, respectively, to achieve the use of the first and best adaptation algorithm to adapt to the dynamic partitioning algorithm allocation process alloc () and recovery of the process of free (). Among them, the idle idle zoning district through the chain to management in memory allocation, the system of priority areas the use of low-end free space. ⑵ under the assumption that the initial state, available memory space for 640KB, and the request of any of the following sequence: 1 to apply for operating  130KB. 2 applications  operating 60KB. 3 to apply for operating  100KB.  2 release of the operating 60KB. 4 to apply for operating  200KB.  3 release of the operating 100KB. 1 the release of the operating  130KB. 5 to apply for operating  140KB. 6  application operating 60KB. Operation 7  applications 50KB.  6 release of the operating 60KB. Algorithm were used to adapt th)