Algorithm

Hi there,
Hope you are doing well,

Please find the below-attached document for guidelines. Kindly drop a message if you are interested and have a rough solution for desired complexity in terms of space and time, good documentation as well as right functioning. Please make sure your bid is accurate. I have also got the test case files.
The idea for the first one: This is a translation constraint optimisation problem into network flow graphs. Clearly, this will involve some kind of demand circulation and lower bound problem, so you will need to understand how to properly decompose the problem into something you can solve with fold-fulkson algorithm.
The idea for the second one: we can use min cost maximal bipartate, creating 0.33 nodes for each person with edge weight 0 for respective breakfast and dinner days where person is willing to prepare it and 0.11 nodes for each person with edge weight 1 to respective breakfast and dinner days where person is willing to prepare and find matching all unmatch dinner or breakfast will be ordered from restro.

Thanks and Warm Regards,
Rose, R