（1）用C语言分别实现采用首次适应算法和最佳适应算法的动态分区分配过程alloc( )和回收过程free( )。其中，空闲分区通过空闲分区链来管理：在进行内存分配时，系统优先使用空闲区低端的空间。

（2）假设初始状态下，可用的内存空间为640KB，并有下列的请求序列：

• 作业1申请130KB。

• 作业2申请60KB。

• 作业3申请100KB。

• 作业2释放60KB。

• 作业4申请200KB。

• 作业3释放100KB。

• 作业1释放130KB。

• 作业5申请140KB。

• 作业6申请60KB。

• 作业7申请50KB。

• 作业6释放60KB。

请分别采用首次适应算法和最佳适应算法，对内存块进行分配和回收，要求每次分配和回收后显示出空闲分区链的情况。-(1) were achieved using C language used first to adapt to the dynamic partitioning algorithm and the optimum allocation process adaptation algorithms alloc () and recovery process free (). Among them, the free partition by free partition chain to management: making memory allocation, the system gives priority to the use of the free zones of low-end space. (2) assuming that the initial state, the available memory space is 640KB, and has the following sequence of requests: •　Job 1 application 130KB. •　Assignment 2 application 60KB. •　Assignment 3 application 100KB. •　Assignment 2 release 60KB. •　Assignment 4 apply 200KB. •　Assignment 3 release 100KB. •　Operating a release 130KB. •　5 to apply for a job 140KB. •　6 to apply for a job 60KB. •　7 to apply for a job 50KB. •　Job 6 release 60KB. Please cases were used for the first time and best adaptation algorithm to adapt algorithms for memory block allocation and recovery requi