Which of the following claims are true and which are false. justify your answer by giving either a (short) proof or a counterexample. (a) in any maximum flow there are no directed cycles that carry positive flow. (a cycle (e1,.ek) carries positive flow iff f(et)> (ek) > 0.) (b) there always exists a maximum flow without cycles carrying positive flow. (c) if all edges in a graph have distinct capacities, there is a unique maximum flow. (d) in a directed graph with at most one edge between each pair of vertices, if we replace each directed edge by an undirected edge, the maximum flow remains unchanged. (e) if we multiply all edge capacities by a positive number a, the minimum cut remains unchan ged.

Consider a byte-addressable computer with 16mb of main memory, a cache capable of storing a total of 64kb of data and block size of 32 bytes. (a) how many bits in the memory address? (b) how many blocks are in the cache? (c) specify the format of the memory address, including names and sizes, when the cache is: 1. direct-mapped 2. 4-way set associative 3. fully associative

Me if you do then you get 10 points and brainliest

Suppose you are an ad-serving company and you maintain a log of cookie data for ads you serve to the web pages for a particular vendor (say amazon). a. how can you use this data to determine which are the best ads? b. how can you use this data to determine which are the best ad formats? c. how could you records of past ads and ad clicks to determine which ads to send to a given ip address? d. how could you use this data to determine how well the technique you used in your answer to part c was working? e. how could you use this data to determine that a given ip address is used by more than one person? f. how does having this data give you a competitive advantage vis-à-vis other ad-serving companies?