You can borrow 6 bits. Which would create a 255.255.255.252 subnet mask, but this subnet only contains 2 usable IP addresses.
7 bits would be 255.255.255.254, but that subnet is too small to have any use in the real world.
The maximum number of hosts per class B network is 65536.
16
254
Since this is a class B network you have borrowed 8 bits for subnets. This leaves 8 bits left (1 octet) for clients/workstations. That gives you a maximum of 254 clients per subnet.
Each network supports a maximum of 16,777,214 (2 24 -2) hosts per network
class A supports maximum number of hosts. | | | | | <------network------><--------------------------------hosts------------------------------------>
The maximum number of host bits that can be borrowed from a class A address is 22 (technically you could borrow 23 but the resulting network would be useless). A class A address uses 8 bits for its network address and 24 bits for its host addresses. Class A uses a subnet mask of 255.0.0.0 You can only borrow 22 bits (instead of 24) because a valid network requires 4 addresses: A network address, two host addresses and a broadcast address. These networks would result in 30 bits used for the network address and 2 bits used for the host addresses. These networks use a subnet mask of 255.255.255.252
14
The runtime complexity of the Edmonds-Karp algorithm for finding the maximum flow in a network is O(VE2), where V is the number of vertices and E is the number of edges in the network.
The time complexity of the Edmonds-Karp algorithm for finding the maximum flow in a network is O(VE2), where V is the number of vertices and E is the number of edges in the network.
100
The time complexity of the Ford-Fulkerson algorithm for finding the maximum flow in a network is O(E f), where E is the number of edges in the network and f is the maximum flow value.