The smallest number of edges in a 2-connected graph with specified diameter

It is proved that, if n is sufficiently large compared with d, then the smallest number of edges in a 2-connected graph with n vertices and diameter at most d   is exactly ⌈(dn-2d-1)/(d-1)⌉⌈(dn-2d-1)/(d-1)⌉.