Suppose that you wish to find, among all minimum cuts in a flow network gg with integral capacities, one that contains the smallest number of edges. show how to modify the capacities of gg to create a new flow network g'g ′ in which any minimum cut in g'g ′ is a minimum cut with the smallest number of edges in gg.

Draw the hierarchy chart and design the logic for a program that calculates service charges for hazel's housecleaning service. the program contains housekeeping, detail loop, and end-of-job modules. the main program declares any needed global variables and constants and calls the other modules. the housekeeping module displays a prompt for and accepts a customer's last name. while the user does not enter for the name, the detail loop accepts the number of bathrooms and the number of other rooms to be cleaned. the service charge is computed as $40 plus $15 for each bathroom and $10 for each of the other rooms. the detail loop also displays the service charge and then prompts the user for the next customer's name. the end-of-job module, which executes after the user enters the sentinel value for the name, displays a message that indicates the program is complete.

When you collaborate or meet with a person or group online, it is called

Plz ( which is an example of a good url?