An extremal problem concerning graphs not containing Kt and Kt,t,t

We consider the following similar modification of Turán's theorem. Let t and n be positive integers with n⩾t⩾2. Determine the maximum number of edges of a graph of order n that contains neither Kt nor Kt,t,t as a subgraph. We solve it for n=3t.