I understand that this quiz is closed-book and closed-notes…

I understand that this quiz is closed-book and closed-notes and that no resources other than the knowledge in my own brain are allowed. I agree not to provide or seek help from others on this quiz. If I have any questions, I will contact my instructor. By checking the box below I acknowledge and agree to these terms.  

You are conducting a mark and recapture study.  As part of t…

You are conducting a mark and recapture study.  As part of this, in a small, isolated tidal pool you capture 100 fiddler crabs, mark their shell and release them back into the environment where you assume they distribute themselves randomly with others in the population.  You then catch 100 more fiddler crabs, of which you find 4 that have been previously marked.  Based on these data, what is your estimate of the total fiddler crab population in the tidal pool?

Fill in the appropriate code: // Combines the current block…

Fill in the appropriate code: // Combines the current block with the previous block if it is free, and/or the next block if it is free// Returns a pointer to the payload space of the (possibly coalesced) block// Assumes size and allocation information packed together and stored in the header and footer of a block // curr_payload – pointer to the user payload space of a free block static void* coalesce(void* curr_payload){     void* prev_payload = prev_payload_pointer(curr_payload);    void* next_payload = next_payload_pointer(curr_payload);     int prev_alloc = extract_alloc([prev_alloc]);    int next_alloc = extract_alloc([next_alloc]);    // Get size of the current block    size_t size = extract_size([size]);     // Cannot combine current block with previous or next blocks    if(prev_alloc && next_alloc){        return [case1_ret];    }     // Combine current block with next block    else if(prev_alloc && !next_alloc){        size += extract_size(get(get_header_pointer(next_payload)));        set([case2_header], pack(size, 0));        set(get_footer_pointer(next_payload), pack(size, 0));        return curr_payload;    }     // Combine current block with previous block    else if(!prev_alloc && next_alloc){        size += extract_size(get(get_header_pointer(prev_payload)));        set([case3_header], pack(size, 0));        set(get_footer_pointer(curr_payload), pack(size, 0));        return prev_payload;    }     // Combine current block with previous and next blocks    else{        size += extract_size(get(get_header_pointer(prev_payload))) + extract_size(get(get_header_pointer(next_payload)));        set([case4_header], pack(size, 0));        set(get_footer_pointer(next_payload), pack(size, 0));        return prev_payload;    } }